/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 19:20:53,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 19:20:53,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 19:20:53,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 19:20:53,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 19:20:53,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 19:20:53,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 19:20:53,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 19:20:53,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 19:20:53,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 19:20:53,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 19:20:53,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 19:20:53,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 19:20:53,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 19:20:53,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 19:20:53,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 19:20:53,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 19:20:53,997 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 19:20:54,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 19:20:54,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 19:20:54,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 19:20:54,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 19:20:54,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 19:20:54,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 19:20:54,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 19:20:54,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 19:20:54,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 19:20:54,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 19:20:54,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 19:20:54,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 19:20:54,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 19:20:54,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 19:20:54,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 19:20:54,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 19:20:54,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 19:20:54,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 19:20:54,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 19:20:54,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 19:20:54,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 19:20:54,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 19:20:54,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 19:20:54,049 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2020-12-22 19:20:54,104 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 19:20:54,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 19:20:54,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 19:20:54,111 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 19:20:54,111 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 19:20:54,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 19:20:54,112 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-22 19:20:54,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 19:20:54,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 19:20:54,113 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-22 19:20:54,114 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-22 19:20:54,114 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-22 19:20:54,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 19:20:54,115 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-22 19:20:54,115 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 19:20:54,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 19:20:54,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 19:20:54,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 19:20:54,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 19:20:54,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 19:20:54,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 19:20:54,117 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 19:20:54,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 19:20:54,118 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 19:20:54,118 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 [2020-12-22 19:20:54,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 19:20:54,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 19:20:54,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 19:20:54,559 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 19:20:54,560 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 19:20:54,561 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2020-12-22 19:20:54,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/424dd27bf/4fca91a1edbd4ae8987bc7ca2a5d6b08/FLAGc66cdfffe [2020-12-22 19:20:55,409 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 19:20:55,410 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2020-12-22 19:20:55,431 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/424dd27bf/4fca91a1edbd4ae8987bc7ca2a5d6b08/FLAGc66cdfffe [2020-12-22 19:20:55,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/424dd27bf/4fca91a1edbd4ae8987bc7ca2a5d6b08 [2020-12-22 19:20:55,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 19:20:55,723 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 19:20:55,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 19:20:55,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 19:20:55,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 19:20:55,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:20:55" (1/1) ... [2020-12-22 19:20:55,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b11150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:20:55, skipping insertion in model container [2020-12-22 19:20:55,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:20:55" (1/1) ... [2020-12-22 19:20:55,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 19:20:55,818 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 19:20:56,167 WARN L226 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-rb-cnstr_1-1.i[22569,22582] [2020-12-22 19:20:56,174 WARN L226 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-rb-cnstr_1-1.i[22645,22658] [2020-12-22 19:20:56,176 WARN L226 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-rb-cnstr_1-1.i[22715,22728] [2020-12-22 19:20:56,178 WARN L226 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-rb-cnstr_1-1.i[22822,22835] [2020-12-22 19:20:56,180 WARN L226 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-rb-cnstr_1-1.i[22894,22907] [2020-12-22 19:20:56,181 WARN L226 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-rb-cnstr_1-1.i[23045,23058] [2020-12-22 19:20:56,183 WARN L226 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-rb-cnstr_1-1.i[23119,23132] [2020-12-22 19:20:56,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 19:20:56,211 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 19:20:56,294 WARN L226 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-rb-cnstr_1-1.i[22569,22582] [2020-12-22 19:20:56,297 WARN L226 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-rb-cnstr_1-1.i[22645,22658] [2020-12-22 19:20:56,298 WARN L226 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-rb-cnstr_1-1.i[22715,22728] [2020-12-22 19:20:56,300 WARN L226 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-rb-cnstr_1-1.i[22822,22835] [2020-12-22 19:20:56,304 WARN L226 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-rb-cnstr_1-1.i[22894,22907] [2020-12-22 19:20:56,306 WARN L226 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-rb-cnstr_1-1.i[23045,23058] [2020-12-22 19:20:56,308 WARN L226 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-rb-cnstr_1-1.i[23119,23132] [2020-12-22 19:20:56,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 19:20:56,380 INFO L208 MainTranslator]: Completed translation [2020-12-22 19:20:56,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:20:56 WrapperNode [2020-12-22 19:20:56,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 19:20:56,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 19:20:56,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 19:20:56,383 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 19:20:56,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:20:56" (1/1) ... [2020-12-22 19:20:56,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:20:56" (1/1) ... [2020-12-22 19:20:56,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 19:20:56,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 19:20:56,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 19:20:56,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 19:20:56,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:20:56" (1/1) ... [2020-12-22 19:20:56,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:20:56" (1/1) ... [2020-12-22 19:20:56,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:20:56" (1/1) ... [2020-12-22 19:20:56,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:20:56" (1/1) ... [2020-12-22 19:20:56,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:20:56" (1/1) ... [2020-12-22 19:20:56,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:20:56" (1/1) ... [2020-12-22 19:20:56,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:20:56" (1/1) ... [2020-12-22 19:20:56,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 19:20:56,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 19:20:56,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 19:20:56,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 19:20:56,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:20:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 19:20:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-22 19:20:56,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-22 19:20:56,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-22 19:20:56,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-22 19:20:56,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 19:20:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-22 19:20:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-22 19:20:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 19:20:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 19:20:56,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 19:20:57,362 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 19:20:57,363 INFO L299 CfgBuilder]: Removed 21 assume(true) statements. [2020-12-22 19:20:57,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:20:57 BoogieIcfgContainer [2020-12-22 19:20:57,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 19:20:57,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 19:20:57,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 19:20:57,371 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 19:20:57,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 07:20:55" (1/3) ... [2020-12-22 19:20:57,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4988ee19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:20:57, skipping insertion in model container [2020-12-22 19:20:57,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:20:56" (2/3) ... [2020-12-22 19:20:57,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4988ee19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:20:57, skipping insertion in model container [2020-12-22 19:20:57,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:20:57" (3/3) ... [2020-12-22 19:20:57,374 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2020-12-22 19:20:57,381 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 19:20:57,387 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2020-12-22 19:20:57,408 INFO L253 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2020-12-22 19:20:57,434 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 19:20:57,434 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-22 19:20:57,434 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 19:20:57,434 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 19:20:57,435 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 19:20:57,435 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 19:20:57,435 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 19:20:57,435 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 19:20:57,459 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2020-12-22 19:20:57,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-22 19:20:57,467 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:20:57,468 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-22 19:20:57,469 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:20:57,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:20:57,477 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2020-12-22 19:20:57,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:20:57,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53543110] [2020-12-22 19:20:57,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:20:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:20:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:20:57,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53543110] [2020-12-22 19:20:57,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 19:20:57,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 19:20:57,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72664550] [2020-12-22 19:20:57,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 19:20:57,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:20:57,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 19:20:57,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 19:20:57,703 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 3 states. [2020-12-22 19:20:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:20:57,896 INFO L93 Difference]: Finished difference Result 155 states and 160 transitions. [2020-12-22 19:20:57,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 19:20:57,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-22 19:20:57,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:20:57,911 INFO L225 Difference]: With dead ends: 155 [2020-12-22 19:20:57,912 INFO L226 Difference]: Without dead ends: 151 [2020-12-22 19:20:57,914 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 19:20:57,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-12-22 19:20:57,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2020-12-22 19:20:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-12-22 19:20:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 154 transitions. [2020-12-22 19:20:57,968 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 154 transitions. Word has length 3 [2020-12-22 19:20:57,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:20:57,968 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 154 transitions. [2020-12-22 19:20:57,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 19:20:57,969 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 154 transitions. [2020-12-22 19:20:57,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-22 19:20:57,969 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:20:57,970 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-22 19:20:57,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 19:20:57,971 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:20:57,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:20:57,972 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2020-12-22 19:20:57,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:20:57,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927695335] [2020-12-22 19:20:57,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:20:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:20:58,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:20:58,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927695335] [2020-12-22 19:20:58,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 19:20:58,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 19:20:58,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022543734] [2020-12-22 19:20:58,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 19:20:58,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:20:58,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 19:20:58,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 19:20:58,034 INFO L87 Difference]: Start difference. First operand 147 states and 154 transitions. Second operand 3 states. [2020-12-22 19:20:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:20:58,186 INFO L93 Difference]: Finished difference Result 164 states and 170 transitions. [2020-12-22 19:20:58,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 19:20:58,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-22 19:20:58,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:20:58,188 INFO L225 Difference]: With dead ends: 164 [2020-12-22 19:20:58,188 INFO L226 Difference]: Without dead ends: 164 [2020-12-22 19:20:58,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 19:20:58,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-12-22 19:20:58,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2020-12-22 19:20:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-12-22 19:20:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 158 transitions. [2020-12-22 19:20:58,202 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 158 transitions. Word has length 3 [2020-12-22 19:20:58,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:20:58,202 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 158 transitions. [2020-12-22 19:20:58,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 19:20:58,203 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 158 transitions. [2020-12-22 19:20:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-22 19:20:58,203 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:20:58,203 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 19:20:58,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 19:20:58,204 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:20:58,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:20:58,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2020-12-22 19:20:58,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:20:58,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964211727] [2020-12-22 19:20:58,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:20:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:20:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:20:58,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964211727] [2020-12-22 19:20:58,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 19:20:58,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 19:20:58,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562268159] [2020-12-22 19:20:58,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 19:20:58,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:20:58,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 19:20:58,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 19:20:58,296 INFO L87 Difference]: Start difference. First operand 151 states and 158 transitions. Second operand 4 states. [2020-12-22 19:20:58,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:20:58,478 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2020-12-22 19:20:58,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 19:20:58,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-22 19:20:58,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:20:58,480 INFO L225 Difference]: With dead ends: 152 [2020-12-22 19:20:58,480 INFO L226 Difference]: Without dead ends: 152 [2020-12-22 19:20:58,481 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 19:20:58,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-12-22 19:20:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 138. [2020-12-22 19:20:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-12-22 19:20:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions. [2020-12-22 19:20:58,491 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 147 transitions. Word has length 9 [2020-12-22 19:20:58,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:20:58,491 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 147 transitions. [2020-12-22 19:20:58,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 19:20:58,491 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2020-12-22 19:20:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-22 19:20:58,492 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:20:58,492 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 19:20:58,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 19:20:58,493 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:20:58,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:20:58,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2020-12-22 19:20:58,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:20:58,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233979634] [2020-12-22 19:20:58,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:20:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:20:58,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:20:58,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233979634] [2020-12-22 19:20:58,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 19:20:58,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 19:20:58,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079584993] [2020-12-22 19:20:58,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 19:20:58,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:20:58,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 19:20:58,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 19:20:58,611 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. Second operand 6 states. [2020-12-22 19:20:58,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:20:58,947 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2020-12-22 19:20:58,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 19:20:58,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-22 19:20:58,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:20:58,951 INFO L225 Difference]: With dead ends: 176 [2020-12-22 19:20:58,951 INFO L226 Difference]: Without dead ends: 176 [2020-12-22 19:20:58,952 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 19:20:58,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-12-22 19:20:58,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 147. [2020-12-22 19:20:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-12-22 19:20:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2020-12-22 19:20:58,981 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 9 [2020-12-22 19:20:58,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:20:58,982 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2020-12-22 19:20:58,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 19:20:58,985 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2020-12-22 19:20:58,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-22 19:20:58,986 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:20:58,986 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 19:20:58,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 19:20:58,987 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:20:58,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:20:58,991 INFO L82 PathProgramCache]: Analyzing trace with hash 233164315, now seen corresponding path program 1 times [2020-12-22 19:20:58,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:20:58,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706457269] [2020-12-22 19:20:58,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:20:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:20:59,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:20:59,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706457269] [2020-12-22 19:20:59,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 19:20:59,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 19:20:59,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083690194] [2020-12-22 19:20:59,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 19:20:59,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:20:59,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 19:20:59,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 19:20:59,097 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand 4 states. [2020-12-22 19:20:59,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:20:59,247 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2020-12-22 19:20:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 19:20:59,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-22 19:20:59,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:20:59,248 INFO L225 Difference]: With dead ends: 161 [2020-12-22 19:20:59,249 INFO L226 Difference]: Without dead ends: 161 [2020-12-22 19:20:59,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 19:20:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-12-22 19:20:59,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 145. [2020-12-22 19:20:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-12-22 19:20:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2020-12-22 19:20:59,261 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 11 [2020-12-22 19:20:59,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:20:59,261 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2020-12-22 19:20:59,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 19:20:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2020-12-22 19:20:59,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-22 19:20:59,263 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:20:59,263 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 19:20:59,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 19:20:59,265 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:20:59,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:20:59,265 INFO L82 PathProgramCache]: Analyzing trace with hash 233113581, now seen corresponding path program 1 times [2020-12-22 19:20:59,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:20:59,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264394142] [2020-12-22 19:20:59,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:20:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:20:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:20:59,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264394142] [2020-12-22 19:20:59,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 19:20:59,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 19:20:59,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489828649] [2020-12-22 19:20:59,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 19:20:59,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:20:59,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 19:20:59,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 19:20:59,374 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand 5 states. [2020-12-22 19:20:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:20:59,611 INFO L93 Difference]: Finished difference Result 194 states and 207 transitions. [2020-12-22 19:20:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 19:20:59,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-22 19:20:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:20:59,613 INFO L225 Difference]: With dead ends: 194 [2020-12-22 19:20:59,614 INFO L226 Difference]: Without dead ends: 194 [2020-12-22 19:20:59,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 19:20:59,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-12-22 19:20:59,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 144. [2020-12-22 19:20:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-12-22 19:20:59,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2020-12-22 19:20:59,619 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 11 [2020-12-22 19:20:59,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:20:59,619 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2020-12-22 19:20:59,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 19:20:59,619 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2020-12-22 19:20:59,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-22 19:20:59,620 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:20:59,620 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 19:20:59,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 19:20:59,621 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:20:59,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:20:59,621 INFO L82 PathProgramCache]: Analyzing trace with hash 233113582, now seen corresponding path program 1 times [2020-12-22 19:20:59,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:20:59,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651476300] [2020-12-22 19:20:59,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:20:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:20:59,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:20:59,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651476300] [2020-12-22 19:20:59,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 19:20:59,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 19:20:59,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041487237] [2020-12-22 19:20:59,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 19:20:59,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:20:59,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 19:20:59,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 19:20:59,700 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 5 states. [2020-12-22 19:20:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:20:59,992 INFO L93 Difference]: Finished difference Result 220 states and 233 transitions. [2020-12-22 19:20:59,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 19:20:59,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-22 19:20:59,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:20:59,994 INFO L225 Difference]: With dead ends: 220 [2020-12-22 19:20:59,994 INFO L226 Difference]: Without dead ends: 220 [2020-12-22 19:20:59,995 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-22 19:20:59,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-12-22 19:20:59,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 143. [2020-12-22 19:20:59,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-12-22 19:20:59,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2020-12-22 19:20:59,999 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 11 [2020-12-22 19:20:59,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:20:59,999 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2020-12-22 19:20:59,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 19:21:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2020-12-22 19:21:00,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-22 19:21:00,000 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:00,001 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 19:21:00,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 19:21:00,001 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:00,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:00,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1240047230, now seen corresponding path program 1 times [2020-12-22 19:21:00,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:00,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969754342] [2020-12-22 19:21:00,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:00,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969754342] [2020-12-22 19:21:00,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 19:21:00,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 19:21:00,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181178701] [2020-12-22 19:21:00,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 19:21:00,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:00,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 19:21:00,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-22 19:21:00,062 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 6 states. [2020-12-22 19:21:00,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:00,341 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2020-12-22 19:21:00,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 19:21:00,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-22 19:21:00,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:00,343 INFO L225 Difference]: With dead ends: 197 [2020-12-22 19:21:00,343 INFO L226 Difference]: Without dead ends: 197 [2020-12-22 19:21:00,344 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-22 19:21:00,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-12-22 19:21:00,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 148. [2020-12-22 19:21:00,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-12-22 19:21:00,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2020-12-22 19:21:00,348 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 14 [2020-12-22 19:21:00,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:00,348 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2020-12-22 19:21:00,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 19:21:00,349 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2020-12-22 19:21:00,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-22 19:21:00,349 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:00,349 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 19:21:00,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 19:21:00,350 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:00,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:00,351 INFO L82 PathProgramCache]: Analyzing trace with hash 51789359, now seen corresponding path program 1 times [2020-12-22 19:21:00,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:00,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143731334] [2020-12-22 19:21:00,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:00,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143731334] [2020-12-22 19:21:00,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 19:21:00,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-22 19:21:00,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450060827] [2020-12-22 19:21:00,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 19:21:00,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:00,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 19:21:00,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-22 19:21:00,462 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand 9 states. [2020-12-22 19:21:00,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:00,965 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2020-12-22 19:21:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 19:21:00,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-12-22 19:21:00,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:00,973 INFO L225 Difference]: With dead ends: 147 [2020-12-22 19:21:00,973 INFO L226 Difference]: Without dead ends: 147 [2020-12-22 19:21:00,975 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-12-22 19:21:00,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-12-22 19:21:00,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2020-12-22 19:21:00,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-12-22 19:21:00,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2020-12-22 19:21:00,981 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 15 [2020-12-22 19:21:00,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:00,981 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2020-12-22 19:21:00,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 19:21:00,981 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2020-12-22 19:21:00,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-22 19:21:00,982 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:00,983 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 19:21:00,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 19:21:00,985 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:00,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:00,988 INFO L82 PathProgramCache]: Analyzing trace with hash 51789360, now seen corresponding path program 1 times [2020-12-22 19:21:00,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:00,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368692137] [2020-12-22 19:21:00,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:01,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368692137] [2020-12-22 19:21:01,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 19:21:01,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-22 19:21:01,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939920165] [2020-12-22 19:21:01,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-22 19:21:01,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:01,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-22 19:21:01,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-12-22 19:21:01,184 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 10 states. [2020-12-22 19:21:02,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:02,151 INFO L93 Difference]: Finished difference Result 164 states and 173 transitions. [2020-12-22 19:21:02,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-22 19:21:02,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-12-22 19:21:02,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:02,155 INFO L225 Difference]: With dead ends: 164 [2020-12-22 19:21:02,155 INFO L226 Difference]: Without dead ends: 164 [2020-12-22 19:21:02,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2020-12-22 19:21:02,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-12-22 19:21:02,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2020-12-22 19:21:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-12-22 19:21:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2020-12-22 19:21:02,160 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 15 [2020-12-22 19:21:02,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:02,161 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2020-12-22 19:21:02,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-22 19:21:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2020-12-22 19:21:02,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-22 19:21:02,162 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:02,162 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 19:21:02,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 19:21:02,163 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:02,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:02,163 INFO L82 PathProgramCache]: Analyzing trace with hash 613129385, now seen corresponding path program 1 times [2020-12-22 19:21:02,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:02,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527106147] [2020-12-22 19:21:02,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:02,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527106147] [2020-12-22 19:21:02,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972539705] [2020-12-22 19:21:02,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:21:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:02,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-22 19:21:02,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 19:21:02,515 INFO L382 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 [2020-12-22 19:21:02,516 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:02,525 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:02,529 INFO L382 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 [2020-12-22 19:21:02,530 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:02,539 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:02,540 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:02,541 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2020-12-22 19:21:02,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:02,609 INFO L382 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 [2020-12-22 19:21:02,616 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:02,632 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:02,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:02,640 INFO L382 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 [2020-12-22 19:21:02,647 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:02,659 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:02,660 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:02,664 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2020-12-22 19:21:02,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:02,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:02,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:02,729 INFO L382 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 [2020-12-22 19:21:02,732 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:02,748 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:02,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:02,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:02,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:02,756 INFO L382 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 [2020-12-22 19:21:02,760 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:02,771 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:02,774 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:02,774 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:36 [2020-12-22 19:21:02,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:02,876 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-22 19:21:02,877 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-12-22 19:21:02,879 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:02,890 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:02,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:02,896 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-22 19:21:02,898 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:02,898 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 22 treesize of output 13 [2020-12-22 19:21:02,900 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:02,907 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:02,912 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:02,913 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:7 [2020-12-22 19:21:02,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:02,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 19:21:02,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2020-12-22 19:21:02,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173338909] [2020-12-22 19:21:02,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-22 19:21:02,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:02,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-22 19:21:02,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-12-22 19:21:02,924 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand 10 states. [2020-12-22 19:21:03,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:03,439 INFO L93 Difference]: Finished difference Result 202 states and 218 transitions. [2020-12-22 19:21:03,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-22 19:21:03,439 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-12-22 19:21:03,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:03,441 INFO L225 Difference]: With dead ends: 202 [2020-12-22 19:21:03,441 INFO L226 Difference]: Without dead ends: 202 [2020-12-22 19:21:03,441 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-12-22 19:21:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-12-22 19:21:03,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 158. [2020-12-22 19:21:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-12-22 19:21:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2020-12-22 19:21:03,454 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 21 [2020-12-22 19:21:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:03,455 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2020-12-22 19:21:03,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-22 19:21:03,455 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2020-12-22 19:21:03,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-22 19:21:03,460 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:03,460 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 19:21:03,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-12-22 19:21:03,679 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:03,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:03,680 INFO L82 PathProgramCache]: Analyzing trace with hash 571111132, now seen corresponding path program 1 times [2020-12-22 19:21:03,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:03,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140355453] [2020-12-22 19:21:03,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:03,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:03,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140355453] [2020-12-22 19:21:03,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 19:21:03,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 19:21:03,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508103586] [2020-12-22 19:21:03,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 19:21:03,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:03,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 19:21:03,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 19:21:03,792 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 5 states. [2020-12-22 19:21:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:03,983 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2020-12-22 19:21:03,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 19:21:03,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-12-22 19:21:03,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:03,984 INFO L225 Difference]: With dead ends: 161 [2020-12-22 19:21:03,985 INFO L226 Difference]: Without dead ends: 161 [2020-12-22 19:21:03,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 19:21:03,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-12-22 19:21:03,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2020-12-22 19:21:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-22 19:21:03,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 168 transitions. [2020-12-22 19:21:03,990 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 168 transitions. Word has length 21 [2020-12-22 19:21:03,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:03,990 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 168 transitions. [2020-12-22 19:21:03,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 19:21:03,990 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2020-12-22 19:21:03,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-22 19:21:03,991 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:03,991 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 19:21:03,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 19:21:03,991 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:03,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:03,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1694717682, now seen corresponding path program 1 times [2020-12-22 19:21:03,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:03,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304121589] [2020-12-22 19:21:03,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:04,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304121589] [2020-12-22 19:21:04,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 19:21:04,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 19:21:04,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100520964] [2020-12-22 19:21:04,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 19:21:04,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:04,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 19:21:04,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 19:21:04,053 INFO L87 Difference]: Start difference. First operand 157 states and 168 transitions. Second operand 4 states. [2020-12-22 19:21:04,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:04,201 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2020-12-22 19:21:04,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 19:21:04,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-12-22 19:21:04,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:04,203 INFO L225 Difference]: With dead ends: 158 [2020-12-22 19:21:04,204 INFO L226 Difference]: Without dead ends: 158 [2020-12-22 19:21:04,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 19:21:04,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-12-22 19:21:04,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2020-12-22 19:21:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-12-22 19:21:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2020-12-22 19:21:04,208 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 21 [2020-12-22 19:21:04,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:04,208 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2020-12-22 19:21:04,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 19:21:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2020-12-22 19:21:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-22 19:21:04,209 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:04,209 INFO L422 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] [2020-12-22 19:21:04,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 19:21:04,210 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:04,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:04,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1143661312, now seen corresponding path program 1 times [2020-12-22 19:21:04,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:04,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803041569] [2020-12-22 19:21:04,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:04,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803041569] [2020-12-22 19:21:04,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 19:21:04,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 19:21:04,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958594368] [2020-12-22 19:21:04,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 19:21:04,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:04,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 19:21:04,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 19:21:04,289 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 5 states. [2020-12-22 19:21:04,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:04,555 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2020-12-22 19:21:04,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 19:21:04,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-12-22 19:21:04,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:04,557 INFO L225 Difference]: With dead ends: 229 [2020-12-22 19:21:04,557 INFO L226 Difference]: Without dead ends: 229 [2020-12-22 19:21:04,558 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 19:21:04,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-12-22 19:21:04,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 154. [2020-12-22 19:21:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-12-22 19:21:04,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2020-12-22 19:21:04,562 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 22 [2020-12-22 19:21:04,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:04,562 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2020-12-22 19:21:04,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 19:21:04,562 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2020-12-22 19:21:04,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-22 19:21:04,564 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:04,565 INFO L422 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] [2020-12-22 19:21:04,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 19:21:04,565 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:04,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:04,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1143661313, now seen corresponding path program 1 times [2020-12-22 19:21:04,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:04,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349953057] [2020-12-22 19:21:04,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:04,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:04,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349953057] [2020-12-22 19:21:04,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 19:21:04,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 19:21:04,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455285507] [2020-12-22 19:21:04,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 19:21:04,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:04,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 19:21:04,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 19:21:04,661 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand 5 states. [2020-12-22 19:21:04,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:04,959 INFO L93 Difference]: Finished difference Result 255 states and 271 transitions. [2020-12-22 19:21:04,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 19:21:04,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-12-22 19:21:04,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:04,964 INFO L225 Difference]: With dead ends: 255 [2020-12-22 19:21:04,964 INFO L226 Difference]: Without dead ends: 255 [2020-12-22 19:21:04,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-22 19:21:04,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-12-22 19:21:04,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 153. [2020-12-22 19:21:04,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-12-22 19:21:04,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 163 transitions. [2020-12-22 19:21:04,973 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 163 transitions. Word has length 22 [2020-12-22 19:21:04,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:04,974 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 163 transitions. [2020-12-22 19:21:04,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 19:21:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2020-12-22 19:21:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-22 19:21:04,981 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:04,981 INFO L422 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] [2020-12-22 19:21:04,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-22 19:21:04,983 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:04,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:04,984 INFO L82 PathProgramCache]: Analyzing trace with hash -2101908, now seen corresponding path program 1 times [2020-12-22 19:21:04,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:04,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436472959] [2020-12-22 19:21:04,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:05,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436472959] [2020-12-22 19:21:05,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 19:21:05,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 19:21:05,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011408782] [2020-12-22 19:21:05,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 19:21:05,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:05,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 19:21:05,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 19:21:05,069 INFO L87 Difference]: Start difference. First operand 153 states and 163 transitions. Second operand 4 states. [2020-12-22 19:21:05,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:05,216 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2020-12-22 19:21:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 19:21:05,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-12-22 19:21:05,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:05,217 INFO L225 Difference]: With dead ends: 152 [2020-12-22 19:21:05,218 INFO L226 Difference]: Without dead ends: 152 [2020-12-22 19:21:05,218 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 19:21:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-12-22 19:21:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2020-12-22 19:21:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-12-22 19:21:05,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2020-12-22 19:21:05,222 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 24 [2020-12-22 19:21:05,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:05,222 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2020-12-22 19:21:05,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 19:21:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2020-12-22 19:21:05,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-22 19:21:05,227 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:05,227 INFO L422 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] [2020-12-22 19:21:05,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-22 19:21:05,227 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:05,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:05,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1643090110, now seen corresponding path program 1 times [2020-12-22 19:21:05,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:05,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24827937] [2020-12-22 19:21:05,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:05,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:05,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24827937] [2020-12-22 19:21:05,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 19:21:05,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 19:21:05,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191990321] [2020-12-22 19:21:05,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 19:21:05,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:05,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 19:21:05,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-22 19:21:05,357 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 8 states. [2020-12-22 19:21:05,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:05,758 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2020-12-22 19:21:05,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 19:21:05,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-12-22 19:21:05,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:05,760 INFO L225 Difference]: With dead ends: 151 [2020-12-22 19:21:05,760 INFO L226 Difference]: Without dead ends: 151 [2020-12-22 19:21:05,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-12-22 19:21:05,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-12-22 19:21:05,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2020-12-22 19:21:05,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-12-22 19:21:05,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2020-12-22 19:21:05,764 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 26 [2020-12-22 19:21:05,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:05,764 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2020-12-22 19:21:05,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 19:21:05,764 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2020-12-22 19:21:05,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-22 19:21:05,765 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:05,765 INFO L422 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] [2020-12-22 19:21:05,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-22 19:21:05,766 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:05,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:05,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1643090109, now seen corresponding path program 1 times [2020-12-22 19:21:05,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:05,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519102761] [2020-12-22 19:21:05,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:05,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519102761] [2020-12-22 19:21:05,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 19:21:05,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-22 19:21:05,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292416929] [2020-12-22 19:21:05,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 19:21:05,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:05,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 19:21:05,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-22 19:21:05,890 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 9 states. [2020-12-22 19:21:06,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:06,465 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2020-12-22 19:21:06,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 19:21:06,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-12-22 19:21:06,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:06,467 INFO L225 Difference]: With dead ends: 148 [2020-12-22 19:21:06,467 INFO L226 Difference]: Without dead ends: 148 [2020-12-22 19:21:06,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-12-22 19:21:06,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-12-22 19:21:06,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 128. [2020-12-22 19:21:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-12-22 19:21:06,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2020-12-22 19:21:06,471 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 26 [2020-12-22 19:21:06,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:06,472 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2020-12-22 19:21:06,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 19:21:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2020-12-22 19:21:06,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-22 19:21:06,472 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:06,472 INFO L422 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] [2020-12-22 19:21:06,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-22 19:21:06,473 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:06,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:06,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2019803920, now seen corresponding path program 1 times [2020-12-22 19:21:06,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:06,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799000604] [2020-12-22 19:21:06,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:06,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:06,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799000604] [2020-12-22 19:21:06,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 19:21:06,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-22 19:21:06,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63396205] [2020-12-22 19:21:06,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-22 19:21:06,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:06,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-22 19:21:06,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-12-22 19:21:06,576 INFO L87 Difference]: Start difference. First operand 128 states and 135 transitions. Second operand 10 states. [2020-12-22 19:21:07,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:07,132 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2020-12-22 19:21:07,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-22 19:21:07,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-12-22 19:21:07,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:07,133 INFO L225 Difference]: With dead ends: 145 [2020-12-22 19:21:07,133 INFO L226 Difference]: Without dead ends: 145 [2020-12-22 19:21:07,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2020-12-22 19:21:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-12-22 19:21:07,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2020-12-22 19:21:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-12-22 19:21:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2020-12-22 19:21:07,137 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 26 [2020-12-22 19:21:07,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:07,137 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2020-12-22 19:21:07,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-22 19:21:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2020-12-22 19:21:07,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 19:21:07,138 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:07,138 INFO L422 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] [2020-12-22 19:21:07,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-22 19:21:07,139 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:07,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:07,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1488743798, now seen corresponding path program 1 times [2020-12-22 19:21:07,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:07,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686377684] [2020-12-22 19:21:07,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-22 19:21:07,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686377684] [2020-12-22 19:21:07,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 19:21:07,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 19:21:07,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476339524] [2020-12-22 19:21:07,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 19:21:07,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:07,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 19:21:07,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 19:21:07,170 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 3 states. [2020-12-22 19:21:07,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:07,215 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2020-12-22 19:21:07,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 19:21:07,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-22 19:21:07,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:07,216 INFO L225 Difference]: With dead ends: 137 [2020-12-22 19:21:07,216 INFO L226 Difference]: Without dead ends: 137 [2020-12-22 19:21:07,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 19:21:07,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-12-22 19:21:07,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-12-22 19:21:07,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-12-22 19:21:07,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2020-12-22 19:21:07,220 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 27 [2020-12-22 19:21:07,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:07,220 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2020-12-22 19:21:07,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 19:21:07,220 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2020-12-22 19:21:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-22 19:21:07,221 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:07,221 INFO L422 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] [2020-12-22 19:21:07,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-22 19:21:07,221 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:07,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:07,222 INFO L82 PathProgramCache]: Analyzing trace with hash 840249207, now seen corresponding path program 1 times [2020-12-22 19:21:07,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:07,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369075451] [2020-12-22 19:21:07,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:07,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369075451] [2020-12-22 19:21:07,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388105729] [2020-12-22 19:21:07,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:21:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:07,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-22 19:21:07,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 19:21:07,378 INFO L382 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 [2020-12-22 19:21:07,378 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:07,380 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:07,381 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:07,381 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-12-22 19:21:07,409 INFO L382 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 [2020-12-22 19:21:07,411 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:07,412 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:07,413 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:07,413 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-12-22 19:21:07,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-22 19:21:07,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 19:21:07,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2020-12-22 19:21:07,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013930484] [2020-12-22 19:21:07,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 19:21:07,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:07,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 19:21:07,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-22 19:21:07,430 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 4 states. [2020-12-22 19:21:07,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:07,525 INFO L93 Difference]: Finished difference Result 146 states and 153 transitions. [2020-12-22 19:21:07,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 19:21:07,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-12-22 19:21:07,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:07,527 INFO L225 Difference]: With dead ends: 146 [2020-12-22 19:21:07,527 INFO L226 Difference]: Without dead ends: 146 [2020-12-22 19:21:07,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-22 19:21:07,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-12-22 19:21:07,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2020-12-22 19:21:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-12-22 19:21:07,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 147 transitions. [2020-12-22 19:21:07,530 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 147 transitions. Word has length 29 [2020-12-22 19:21:07,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:07,531 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 147 transitions. [2020-12-22 19:21:07,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 19:21:07,531 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2020-12-22 19:21:07,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-22 19:21:07,532 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:07,532 INFO L422 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] [2020-12-22 19:21:07,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:21:07,748 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:07,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:07,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1333877133, now seen corresponding path program 1 times [2020-12-22 19:21:07,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:07,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683438197] [2020-12-22 19:21:07,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:07,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683438197] [2020-12-22 19:21:07,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627761407] [2020-12-22 19:21:07,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:21:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:07,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-22 19:21:07,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 19:21:08,000 INFO L382 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 [2020-12-22 19:21:08,001 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:08,006 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:08,009 INFO L382 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 [2020-12-22 19:21:08,010 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:08,027 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:08,028 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:08,028 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2020-12-22 19:21:08,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:08,041 INFO L382 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 [2020-12-22 19:21:08,043 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:08,051 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:08,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:08,056 INFO L382 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 [2020-12-22 19:21:08,060 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:08,068 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:08,069 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:08,069 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2020-12-22 19:21:08,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:08,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:08,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:08,108 INFO L382 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 [2020-12-22 19:21:08,113 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:08,124 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:08,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:08,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:08,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:08,132 INFO L382 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 [2020-12-22 19:21:08,134 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:08,143 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:08,147 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:08,147 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:33 [2020-12-22 19:21:08,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:08,200 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2020-12-22 19:21:08,201 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:08,209 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:08,213 INFO L348 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-12-22 19:21:08,213 INFO L382 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 24 treesize of output 10 [2020-12-22 19:21:08,216 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:08,219 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:08,220 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:08,220 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2020-12-22 19:21:08,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-22 19:21:08,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 19:21:08,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2020-12-22 19:21:08,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233827294] [2020-12-22 19:21:08,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-22 19:21:08,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:08,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-22 19:21:08,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-12-22 19:21:08,235 INFO L87 Difference]: Start difference. First operand 140 states and 147 transitions. Second operand 10 states. [2020-12-22 19:21:08,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:08,965 INFO L93 Difference]: Finished difference Result 193 states and 203 transitions. [2020-12-22 19:21:08,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-22 19:21:08,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2020-12-22 19:21:08,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:08,972 INFO L225 Difference]: With dead ends: 193 [2020-12-22 19:21:08,972 INFO L226 Difference]: Without dead ends: 193 [2020-12-22 19:21:08,973 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-12-22 19:21:08,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-12-22 19:21:08,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 151. [2020-12-22 19:21:08,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-12-22 19:21:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2020-12-22 19:21:08,978 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 30 [2020-12-22 19:21:08,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:08,979 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2020-12-22 19:21:08,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-22 19:21:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2020-12-22 19:21:08,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-22 19:21:08,980 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:08,980 INFO L422 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] [2020-12-22 19:21:09,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-12-22 19:21:09,195 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:09,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:09,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1599481477, now seen corresponding path program 1 times [2020-12-22 19:21:09,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:09,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016928364] [2020-12-22 19:21:09,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-22 19:21:09,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016928364] [2020-12-22 19:21:09,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382622202] [2020-12-22 19:21:09,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:21:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:09,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-22 19:21:09,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 19:21:09,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-22 19:21:09,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 19:21:09,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2020-12-22 19:21:09,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974820108] [2020-12-22 19:21:09,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 19:21:09,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:09,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 19:21:09,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 19:21:09,431 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 6 states. [2020-12-22 19:21:09,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:09,638 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2020-12-22 19:21:09,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 19:21:09,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-12-22 19:21:09,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:09,640 INFO L225 Difference]: With dead ends: 159 [2020-12-22 19:21:09,640 INFO L226 Difference]: Without dead ends: 136 [2020-12-22 19:21:09,640 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 19:21:09,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-12-22 19:21:09,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2020-12-22 19:21:09,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-12-22 19:21:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2020-12-22 19:21:09,644 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 31 [2020-12-22 19:21:09,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:09,644 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2020-12-22 19:21:09,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 19:21:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2020-12-22 19:21:09,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-22 19:21:09,645 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:09,645 INFO L422 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] [2020-12-22 19:21:09,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:21:09,846 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:09,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:09,847 INFO L82 PathProgramCache]: Analyzing trace with hash 161084136, now seen corresponding path program 1 times [2020-12-22 19:21:09,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:09,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315068559] [2020-12-22 19:21:09,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:10,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315068559] [2020-12-22 19:21:10,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430304243] [2020-12-22 19:21:10,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:21:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:10,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 34 conjunts are in the unsatisfiable core [2020-12-22 19:21:10,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 19:21:10,305 INFO L382 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 [2020-12-22 19:21:10,305 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:10,309 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:10,310 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:10,310 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-22 19:21:10,328 INFO L382 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 [2020-12-22 19:21:10,329 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:10,335 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:10,336 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:10,337 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2020-12-22 19:21:10,371 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:10,372 INFO L382 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 15 [2020-12-22 19:21:10,375 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:10,380 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:10,390 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:10,391 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:10,391 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2020-12-22 19:21:10,409 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_41|], 2=[|v_#memory_int_33|]} [2020-12-22 19:21:10,414 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-22 19:21:10,415 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:10,430 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:10,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:10,436 INFO L382 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 [2020-12-22 19:21:10,437 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:10,468 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:10,471 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:10,471 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2020-12-22 19:21:10,547 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:10,548 INFO L382 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 61 treesize of output 71 [2020-12-22 19:21:10,553 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-22 19:21:10,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:21:10,560 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:10,575 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:10,580 INFO L382 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 41 treesize of output 13 [2020-12-22 19:21:10,582 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:10,594 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:10,596 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:21:10,596 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:42 [2020-12-22 19:21:10,676 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:10,677 INFO L382 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 28 [2020-12-22 19:21:10,679 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:10,686 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:10,688 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:10,688 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:17 [2020-12-22 19:21:10,698 INFO L382 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 [2020-12-22 19:21:10,699 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:10,705 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:10,706 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:10,706 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2020-12-22 19:21:10,722 INFO L382 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 [2020-12-22 19:21:10,724 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:10,732 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:10,736 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 19:21:10,736 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2020-12-22 19:21:10,937 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2020-12-22 19:21:10,939 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:10,943 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:10,945 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:10,945 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2020-12-22 19:21:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:10,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 19:21:10,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 19 [2020-12-22 19:21:10,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450830911] [2020-12-22 19:21:10,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-22 19:21:10,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:10,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-22 19:21:10,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2020-12-22 19:21:10,958 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 19 states. [2020-12-22 19:21:12,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:12,273 INFO L93 Difference]: Finished difference Result 225 states and 240 transitions. [2020-12-22 19:21:12,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-22 19:21:12,273 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2020-12-22 19:21:12,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:12,276 INFO L225 Difference]: With dead ends: 225 [2020-12-22 19:21:12,276 INFO L226 Difference]: Without dead ends: 225 [2020-12-22 19:21:12,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2020-12-22 19:21:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-12-22 19:21:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 161. [2020-12-22 19:21:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-12-22 19:21:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2020-12-22 19:21:12,282 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 34 [2020-12-22 19:21:12,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:12,282 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2020-12-22 19:21:12,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-22 19:21:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2020-12-22 19:21:12,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-22 19:21:12,283 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:12,283 INFO L422 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] [2020-12-22 19:21:12,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-12-22 19:21:12,498 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:12,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:12,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1577253510, now seen corresponding path program 1 times [2020-12-22 19:21:12,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:12,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135107317] [2020-12-22 19:21:12,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:12,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:12,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135107317] [2020-12-22 19:21:12,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 19:21:12,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-22 19:21:12,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971813983] [2020-12-22 19:21:12,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 19:21:12,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:12,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 19:21:12,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-22 19:21:12,599 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand 9 states. [2020-12-22 19:21:13,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:13,085 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2020-12-22 19:21:13,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 19:21:13,086 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2020-12-22 19:21:13,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:13,087 INFO L225 Difference]: With dead ends: 169 [2020-12-22 19:21:13,087 INFO L226 Difference]: Without dead ends: 169 [2020-12-22 19:21:13,087 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-12-22 19:21:13,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-12-22 19:21:13,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2020-12-22 19:21:13,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-12-22 19:21:13,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2020-12-22 19:21:13,095 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 35 [2020-12-22 19:21:13,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:13,096 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2020-12-22 19:21:13,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 19:21:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2020-12-22 19:21:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-22 19:21:13,096 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:13,097 INFO L422 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] [2020-12-22 19:21:13,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-22 19:21:13,097 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:13,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:13,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1154571519, now seen corresponding path program 1 times [2020-12-22 19:21:13,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:13,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619558348] [2020-12-22 19:21:13,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:13,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619558348] [2020-12-22 19:21:13,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69916077] [2020-12-22 19:21:13,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:21:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:13,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 44 conjunts are in the unsatisfiable core [2020-12-22 19:21:13,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 19:21:13,417 INFO L382 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 [2020-12-22 19:21:13,418 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:13,422 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:13,423 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:13,423 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-22 19:21:13,484 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:13,490 INFO L382 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 28 [2020-12-22 19:21:13,492 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:13,515 INFO L625 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2020-12-22 19:21:13,516 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:21:13,517 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20 [2020-12-22 19:21:13,628 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:13,628 INFO L382 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 19 treesize of output 42 [2020-12-22 19:21:13,630 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:13,669 INFO L625 ElimStorePlain]: treesize reduction 16, result has 70.9 percent of original size [2020-12-22 19:21:13,670 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:13,670 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:39 [2020-12-22 19:21:13,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 19:21:13,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:13,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:13,742 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:13,743 INFO L382 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 1 case distinctions, treesize of input 34 treesize of output 33 [2020-12-22 19:21:13,744 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:13,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:13,752 INFO L382 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 27 treesize of output 11 [2020-12-22 19:21:13,753 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:13,814 INFO L625 ElimStorePlain]: treesize reduction 21, result has 73.1 percent of original size [2020-12-22 19:21:13,816 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-22 19:21:13,816 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:100, output treesize:57 [2020-12-22 19:21:13,854 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 2, 1] term [2020-12-22 19:21:13,854 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:21:13,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:14,189 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:14,194 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:14,198 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:14,203 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:14,206 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 19:21:14,216 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 19:21:14,243 INFO L382 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 [2020-12-22 19:21:14,244 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:14,256 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:14,257 INFO L382 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 39 treesize of output 34 [2020-12-22 19:21:14,261 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:14,344 INFO L625 ElimStorePlain]: treesize reduction 3, result has 96.1 percent of original size [2020-12-22 19:21:14,348 INFO L382 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 [2020-12-22 19:21:14,350 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:14,362 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:14,363 INFO L382 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 15 treesize of output 19 [2020-12-22 19:21:14,364 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2020-12-22 19:21:14,426 INFO L625 ElimStorePlain]: treesize reduction 12, result has 80.0 percent of original size [2020-12-22 19:21:14,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:14,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:14,435 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-12-22 19:21:14,436 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:101, output treesize:24 [2020-12-22 19:21:14,534 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:14,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:14,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:14,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 19:21:14,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2020-12-22 19:21:14,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850922968] [2020-12-22 19:21:14,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-22 19:21:14,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:14,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-22 19:21:14,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=430, Unknown=1, NotChecked=0, Total=506 [2020-12-22 19:21:14,561 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand 23 states. [2020-12-22 19:21:15,112 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2020-12-22 19:21:15,459 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2020-12-22 19:21:17,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:17,283 INFO L93 Difference]: Finished difference Result 222 states and 237 transitions. [2020-12-22 19:21:17,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-22 19:21:17,284 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 41 [2020-12-22 19:21:17,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:17,284 INFO L225 Difference]: With dead ends: 222 [2020-12-22 19:21:17,285 INFO L226 Difference]: Without dead ends: 222 [2020-12-22 19:21:17,285 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=302, Invalid=1257, Unknown=1, NotChecked=0, Total=1560 [2020-12-22 19:21:17,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-12-22 19:21:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 160. [2020-12-22 19:21:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-12-22 19:21:17,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 172 transitions. [2020-12-22 19:21:17,290 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 172 transitions. Word has length 41 [2020-12-22 19:21:17,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:17,290 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 172 transitions. [2020-12-22 19:21:17,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-22 19:21:17,290 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 172 transitions. [2020-12-22 19:21:17,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-22 19:21:17,291 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:17,291 INFO L422 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] [2020-12-22 19:21:17,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:21:17,507 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:17,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:17,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1154571520, now seen corresponding path program 1 times [2020-12-22 19:21:17,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:17,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509014409] [2020-12-22 19:21:17,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:17,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:17,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509014409] [2020-12-22 19:21:17,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968646047] [2020-12-22 19:21:17,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:21:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:17,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 45 conjunts are in the unsatisfiable core [2020-12-22 19:21:17,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 19:21:17,957 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:17,958 INFO L382 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 19 treesize of output 42 [2020-12-22 19:21:17,961 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:18,002 INFO L625 ElimStorePlain]: treesize reduction 24, result has 61.9 percent of original size [2020-12-22 19:21:18,028 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:18,029 INFO L382 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 19 treesize of output 42 [2020-12-22 19:21:18,037 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:18,079 INFO L625 ElimStorePlain]: treesize reduction 16, result has 72.9 percent of original size [2020-12-22 19:21:18,080 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:18,081 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:43 [2020-12-22 19:21:18,152 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 19:21:18,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:18,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:18,181 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:18,181 INFO L382 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 1 case distinctions, treesize of input 34 treesize of output 33 [2020-12-22 19:21:18,183 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:18,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:18,196 INFO L382 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2020-12-22 19:21:18,198 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:18,306 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-12-22 19:21:18,307 INFO L625 ElimStorePlain]: treesize reduction 18, result has 86.2 percent of original size [2020-12-22 19:21:18,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:18,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:18,329 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:18,329 INFO L382 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 1 case distinctions, treesize of input 34 treesize of output 33 [2020-12-22 19:21:18,331 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:18,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:18,339 INFO L382 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 27 treesize of output 11 [2020-12-22 19:21:18,340 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:18,406 INFO L625 ElimStorePlain]: treesize reduction 16, result has 82.2 percent of original size [2020-12-22 19:21:18,407 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-22 19:21:18,407 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:160, output treesize:74 [2020-12-22 19:21:18,490 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2020-12-22 19:21:18,490 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 19:21:18,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:18,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:18,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:18,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:18,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 19:21:18,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 19:21:18,766 INFO L382 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 [2020-12-22 19:21:18,767 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:18,780 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:18,781 INFO L382 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 53 treesize of output 48 [2020-12-22 19:21:18,783 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:18,841 INFO L625 ElimStorePlain]: treesize reduction 3, result has 96.4 percent of original size [2020-12-22 19:21:18,852 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:18,852 INFO L382 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 50 treesize of output 41 [2020-12-22 19:21:18,854 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:18,858 INFO L382 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 [2020-12-22 19:21:18,859 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:18,902 INFO L625 ElimStorePlain]: treesize reduction 12, result has 76.5 percent of original size [2020-12-22 19:21:18,905 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-12-22 19:21:18,905 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:108, output treesize:24 [2020-12-22 19:21:19,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:19,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 19:21:19,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2020-12-22 19:21:19,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334649659] [2020-12-22 19:21:19,086 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-22 19:21:19,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:19,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-22 19:21:19,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2020-12-22 19:21:19,088 INFO L87 Difference]: Start difference. First operand 160 states and 172 transitions. Second operand 25 states. [2020-12-22 19:21:20,012 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 44 [2020-12-22 19:21:20,237 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2020-12-22 19:21:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:22,233 INFO L93 Difference]: Finished difference Result 230 states and 246 transitions. [2020-12-22 19:21:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-22 19:21:22,234 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41 [2020-12-22 19:21:22,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:22,235 INFO L225 Difference]: With dead ends: 230 [2020-12-22 19:21:22,235 INFO L226 Difference]: Without dead ends: 230 [2020-12-22 19:21:22,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=334, Invalid=1646, Unknown=0, NotChecked=0, Total=1980 [2020-12-22 19:21:22,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-12-22 19:21:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 163. [2020-12-22 19:21:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-22 19:21:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 175 transitions. [2020-12-22 19:21:22,240 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 175 transitions. Word has length 41 [2020-12-22 19:21:22,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:22,241 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 175 transitions. [2020-12-22 19:21:22,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-22 19:21:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 175 transitions. [2020-12-22 19:21:22,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-12-22 19:21:22,242 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:22,242 INFO L422 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] [2020-12-22 19:21:22,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-12-22 19:21:22,446 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:22,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:22,447 INFO L82 PathProgramCache]: Analyzing trace with hash 664179058, now seen corresponding path program 1 times [2020-12-22 19:21:22,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:22,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043778452] [2020-12-22 19:21:22,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:23,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043778452] [2020-12-22 19:21:23,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594209627] [2020-12-22 19:21:23,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:21:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:23,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 49 conjunts are in the unsatisfiable core [2020-12-22 19:21:23,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 19:21:23,188 INFO L382 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 [2020-12-22 19:21:23,189 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,193 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:23,193 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,193 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-22 19:21:23,201 INFO L382 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 [2020-12-22 19:21:23,202 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,208 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:23,209 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,209 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2020-12-22 19:21:23,242 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:23,242 INFO L382 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 39 [2020-12-22 19:21:23,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:23,246 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,259 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:23,260 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,260 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:35 [2020-12-22 19:21:23,309 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_47|], 2=[|v_#memory_int_38|]} [2020-12-22 19:21:23,314 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-22 19:21:23,315 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,348 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:23,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:23,354 INFO L382 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 [2020-12-22 19:21:23,355 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,372 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:23,373 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,373 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:43 [2020-12-22 19:21:23,484 INFO L382 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 41 treesize of output 13 [2020-12-22 19:21:23,485 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,502 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:23,522 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:23,523 INFO L382 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 57 [2020-12-22 19:21:23,525 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-22 19:21:23,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:21:23,526 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-22 19:21:23,563 INFO L625 ElimStorePlain]: treesize reduction 33, result has 62.9 percent of original size [2020-12-22 19:21:23,564 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:21:23,565 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:56 [2020-12-22 19:21:23,652 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:23,652 INFO L382 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 38 treesize of output 33 [2020-12-22 19:21:23,653 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,666 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:23,667 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,668 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:27 [2020-12-22 19:21:23,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:23,738 INFO L382 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 [2020-12-22 19:21:23,739 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,751 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:23,752 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,752 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:27 [2020-12-22 19:21:23,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:23,781 INFO L382 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 [2020-12-22 19:21:23,782 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,800 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:23,801 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,801 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:36 [2020-12-22 19:21:23,865 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:23,866 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-22 19:21:23,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 19:21:23,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:23,871 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,882 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:23,882 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,882 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:34 [2020-12-22 19:21:23,936 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_49|], 6=[|v_#memory_int_42|]} [2020-12-22 19:21:23,947 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-22 19:21:23,948 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,967 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:23,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:23,974 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2020-12-22 19:21:23,980 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,995 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:23,998 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:23,998 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:42 [2020-12-22 19:21:24,100 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_50|], 6=[|v_#memory_int_43|]} [2020-12-22 19:21:24,119 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:24,119 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 75 [2020-12-22 19:21:24,121 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-22 19:21:24,122 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 19:21:24,124 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:24,142 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:24,147 INFO L382 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 50 treesize of output 25 [2020-12-22 19:21:24,148 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:24,162 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:24,163 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:21:24,163 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:55 [2020-12-22 19:21:24,259 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:24,260 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 32 [2020-12-22 19:21:24,262 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:24,274 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:24,277 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 19:21:24,277 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:34 [2020-12-22 19:21:24,413 INFO L382 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 34 treesize of output 25 [2020-12-22 19:21:24,414 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:24,427 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:24,429 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 19:21:24,429 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:34 [2020-12-22 19:21:24,493 INFO L382 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 32 treesize of output 34 [2020-12-22 19:21:24,494 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:24,508 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:24,512 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-22 19:21:24,512 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:43 [2020-12-22 19:21:24,816 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2020-12-22 19:21:24,817 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:24,824 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:24,826 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:24,826 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2020-12-22 19:21:24,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:24,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 19:21:24,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 36 [2020-12-22 19:21:24,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185220999] [2020-12-22 19:21:24,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-12-22 19:21:24,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:24,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-12-22 19:21:24,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1030, Unknown=0, NotChecked=0, Total=1260 [2020-12-22 19:21:24,851 INFO L87 Difference]: Start difference. First operand 163 states and 175 transitions. Second operand 36 states. [2020-12-22 19:21:41,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:41,963 INFO L93 Difference]: Finished difference Result 297 states and 319 transitions. [2020-12-22 19:21:41,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-12-22 19:21:41,963 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2020-12-22 19:21:41,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:41,965 INFO L225 Difference]: With dead ends: 297 [2020-12-22 19:21:41,966 INFO L226 Difference]: Without dead ends: 297 [2020-12-22 19:21:41,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=602, Invalid=2702, Unknown=2, NotChecked=0, Total=3306 [2020-12-22 19:21:41,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-12-22 19:21:41,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 188. [2020-12-22 19:21:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-12-22 19:21:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2020-12-22 19:21:41,994 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 43 [2020-12-22 19:21:41,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:41,994 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2020-12-22 19:21:41,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-12-22 19:21:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2020-12-22 19:21:41,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-22 19:21:41,994 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:41,994 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 19:21:42,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-12-22 19:21:42,196 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:42,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:42,197 INFO L82 PathProgramCache]: Analyzing trace with hash -768790931, now seen corresponding path program 2 times [2020-12-22 19:21:42,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:42,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106005142] [2020-12-22 19:21:42,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:42,764 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:42,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106005142] [2020-12-22 19:21:42,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381195813] [2020-12-22 19:21:42,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:21:42,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 19:21:42,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 19:21:42,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 66 conjunts are in the unsatisfiable core [2020-12-22 19:21:42,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 19:21:42,867 INFO L382 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 [2020-12-22 19:21:42,868 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:42,872 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:42,872 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:42,873 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-22 19:21:42,889 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:42,889 INFO L382 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 15 [2020-12-22 19:21:42,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:42,892 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:42,900 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:42,901 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:42,901 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2020-12-22 19:21:42,939 INFO L382 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 [2020-12-22 19:21:42,940 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:42,951 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:42,955 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-22 19:21:42,955 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:42,967 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:42,969 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:42,969 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2020-12-22 19:21:43,089 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:43,090 INFO L382 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 51 treesize of output 65 [2020-12-22 19:21:43,095 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-22 19:21:43,095 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:21:43,097 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-22 19:21:43,140 INFO L625 ElimStorePlain]: treesize reduction 41, result has 59.0 percent of original size [2020-12-22 19:21:43,149 INFO L382 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 24 [2020-12-22 19:21:43,150 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:43,169 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:43,170 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:21:43,170 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2020-12-22 19:21:43,371 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-22 19:21:43,409 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:43,410 INFO L382 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 53 treesize of output 106 [2020-12-22 19:21:43,413 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:43,472 INFO L625 ElimStorePlain]: treesize reduction 16, result has 81.6 percent of original size [2020-12-22 19:21:43,493 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:43,493 INFO L382 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 35 treesize of output 55 [2020-12-22 19:21:43,495 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:43,554 INFO L625 ElimStorePlain]: treesize reduction 22, result has 75.3 percent of original size [2020-12-22 19:21:43,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:43,556 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:21:43,556 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:67 [2020-12-22 19:21:43,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:43,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:43,651 INFO L382 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 [2020-12-22 19:21:43,653 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:43,674 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:43,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:43,679 INFO L382 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 41 treesize of output 24 [2020-12-22 19:21:43,680 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:43,696 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:43,697 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:43,697 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:39 [2020-12-22 19:21:44,092 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:44,092 INFO L382 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 69 treesize of output 44 [2020-12-22 19:21:44,094 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 19:21:44,096 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:21:44,106 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:44,109 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2020-12-22 19:21:44,110 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:44,116 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:44,117 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:44,118 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:7 [2020-12-22 19:21:44,138 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:44,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 19:21:44,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 33 [2020-12-22 19:21:44,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958778925] [2020-12-22 19:21:44,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-12-22 19:21:44,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:44,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-12-22 19:21:44,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=920, Unknown=0, NotChecked=0, Total=1056 [2020-12-22 19:21:44,140 INFO L87 Difference]: Start difference. First operand 188 states and 201 transitions. Second operand 33 states. [2020-12-22 19:21:49,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:49,190 INFO L93 Difference]: Finished difference Result 262 states and 280 transitions. [2020-12-22 19:21:49,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-22 19:21:49,196 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 46 [2020-12-22 19:21:49,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:49,199 INFO L225 Difference]: With dead ends: 262 [2020-12-22 19:21:49,199 INFO L226 Difference]: Without dead ends: 262 [2020-12-22 19:21:49,201 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=431, Invalid=2431, Unknown=0, NotChecked=0, Total=2862 [2020-12-22 19:21:49,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-12-22 19:21:49,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 190. [2020-12-22 19:21:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-12-22 19:21:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 203 transitions. [2020-12-22 19:21:49,207 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 203 transitions. Word has length 46 [2020-12-22 19:21:49,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:49,207 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 203 transitions. [2020-12-22 19:21:49,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-12-22 19:21:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 203 transitions. [2020-12-22 19:21:49,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-22 19:21:49,208 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:49,208 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 19:21:49,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-12-22 19:21:49,420 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:49,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:49,421 INFO L82 PathProgramCache]: Analyzing trace with hash -810809184, now seen corresponding path program 1 times [2020-12-22 19:21:49,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:49,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568056803] [2020-12-22 19:21:49,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:50,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:50,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568056803] [2020-12-22 19:21:50,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064723138] [2020-12-22 19:21:50,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:21:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:50,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 41 conjunts are in the unsatisfiable core [2020-12-22 19:21:50,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 19:21:50,278 INFO L382 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 [2020-12-22 19:21:50,278 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:50,283 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:50,283 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:50,284 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-22 19:21:50,349 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_64|], 1=[|v_#valid_89|]} [2020-12-22 19:21:50,352 INFO L382 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 [2020-12-22 19:21:50,353 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:50,364 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:50,373 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:50,374 INFO L382 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 15 [2020-12-22 19:21:50,375 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:50,376 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:50,388 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:50,389 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:50,391 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2020-12-22 19:21:50,442 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-22 19:21:50,443 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:50,459 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:50,460 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:50,461 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2020-12-22 19:21:50,595 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:50,595 INFO L382 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 57 [2020-12-22 19:21:50,597 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-22 19:21:50,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:21:50,600 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-22 19:21:50,640 INFO L625 ElimStorePlain]: treesize reduction 33, result has 54.8 percent of original size [2020-12-22 19:21:50,642 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:21:50,642 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2020-12-22 19:21:50,913 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:50,914 INFO L382 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 110 [2020-12-22 19:21:50,918 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:50,960 INFO L625 ElimStorePlain]: treesize reduction 16, result has 73.8 percent of original size [2020-12-22 19:21:50,962 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:50,962 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:30 [2020-12-22 19:21:51,027 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_46|], 6=[|v_#memory_$Pointer$.base_58|]} [2020-12-22 19:21:51,032 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2020-12-22 19:21:51,033 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:51,053 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:51,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:51,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:51,068 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:51,068 INFO L382 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 73 [2020-12-22 19:21:51,072 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:51,088 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:51,090 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:21:51,090 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:59 [2020-12-22 19:21:51,381 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:51,381 INFO L382 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 60 treesize of output 47 [2020-12-22 19:21:51,383 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:51,398 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:51,401 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:21:51,401 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:69, output treesize:25 [2020-12-22 19:21:51,561 INFO L382 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 20 treesize of output 14 [2020-12-22 19:21:51,563 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:51,576 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:51,587 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:51,587 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-12-22 19:21:51,588 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-22 19:21:51,600 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:51,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 19:21:51,603 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:21:51,603 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:14 [2020-12-22 19:21:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:51,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 19:21:51,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 38 [2020-12-22 19:21:51,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16926707] [2020-12-22 19:21:51,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-12-22 19:21:51,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:21:51,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-12-22 19:21:51,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2020-12-22 19:21:51,712 INFO L87 Difference]: Start difference. First operand 190 states and 203 transitions. Second operand 38 states. [2020-12-22 19:21:52,671 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2020-12-22 19:21:54,663 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2020-12-22 19:21:54,911 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2020-12-22 19:21:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:21:56,768 INFO L93 Difference]: Finished difference Result 226 states and 240 transitions. [2020-12-22 19:21:56,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-22 19:21:56,768 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 46 [2020-12-22 19:21:56,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:21:56,770 INFO L225 Difference]: With dead ends: 226 [2020-12-22 19:21:56,770 INFO L226 Difference]: Without dead ends: 225 [2020-12-22 19:21:56,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=445, Invalid=3215, Unknown=0, NotChecked=0, Total=3660 [2020-12-22 19:21:56,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-12-22 19:21:56,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 189. [2020-12-22 19:21:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-12-22 19:21:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 201 transitions. [2020-12-22 19:21:56,777 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 201 transitions. Word has length 46 [2020-12-22 19:21:56,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:21:56,778 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 201 transitions. [2020-12-22 19:21:56,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-12-22 19:21:56,778 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 201 transitions. [2020-12-22 19:21:56,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-22 19:21:56,779 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:21:56,779 INFO L422 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] [2020-12-22 19:21:56,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:21:56,993 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:21:56,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:21:56,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1603811789, now seen corresponding path program 1 times [2020-12-22 19:21:56,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:21:56,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130222833] [2020-12-22 19:21:56,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:21:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:57,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:21:57,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130222833] [2020-12-22 19:21:57,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140973997] [2020-12-22 19:21:57,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:21:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:21:57,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 45 conjunts are in the unsatisfiable core [2020-12-22 19:21:57,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 19:21:57,347 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-12-22 19:21:57,348 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2020-12-22 19:21:57,349 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:57,363 INFO L625 ElimStorePlain]: treesize reduction 8, result has 66.7 percent of original size [2020-12-22 19:21:57,364 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 19:21:57,364 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2020-12-22 19:21:57,428 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:57,428 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 58 [2020-12-22 19:21:57,430 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:57,458 INFO L625 ElimStorePlain]: treesize reduction 24, result has 50.0 percent of original size [2020-12-22 19:21:57,460 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:21:57,460 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:24 [2020-12-22 19:21:57,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:57,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 19:21:57,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:57,722 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:57,723 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 17 treesize of output 36 [2020-12-22 19:21:57,724 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:57,750 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:57,751 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 44 [2020-12-22 19:21:57,752 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:57,864 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2020-12-22 19:21:57,865 INFO L625 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2020-12-22 19:21:57,867 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-12-22 19:21:57,868 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:62 [2020-12-22 19:21:57,949 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-12-22 19:21:57,949 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:58,114 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:58,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:58,118 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 19:21:58,148 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:58,148 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2020-12-22 19:21:58,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 19:21:58,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:58,152 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:58,169 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:58,169 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-22 19:21:58,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 19:21:58,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:58,173 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:58,208 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:58,239 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:58,239 INFO L382 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 19 treesize of output 42 [2020-12-22 19:21:58,241 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:58,266 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:58,267 INFO L382 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 1 case distinctions, treesize of input 19 treesize of output 42 [2020-12-22 19:21:58,269 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:58,374 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2020-12-22 19:21:58,374 INFO L625 ElimStorePlain]: treesize reduction 32, result has 69.8 percent of original size [2020-12-22 19:21:58,377 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-22 19:21:58,377 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:88, output treesize:70 [2020-12-22 19:21:58,513 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 2, 1] term [2020-12-22 19:21:58,514 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:58,515 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 1] term [2020-12-22 19:21:58,515 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 19:21:58,516 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:58,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 19:21:58,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 19:21:58,521 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 2, 1] term [2020-12-22 19:21:58,521 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 19:21:58,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:58,531 INFO L443 ElimStorePlain]: Different costs {2=[v_prenex_4, v_prenex_3], 6=[v_prenex_5, |v_#memory_$Pointer$.base_60|]} [2020-12-22 19:21:58,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:58,546 INFO L382 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 27 treesize of output 11 [2020-12-22 19:21:58,547 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:58,696 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2020-12-22 19:21:58,697 INFO L625 ElimStorePlain]: treesize reduction 4, result has 97.5 percent of original size [2020-12-22 19:21:58,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:58,706 INFO L382 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 27 treesize of output 11 [2020-12-22 19:21:58,707 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:21:58,801 INFO L625 ElimStorePlain]: treesize reduction 14, result has 89.6 percent of original size [2020-12-22 19:21:58,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:58,840 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:58,840 INFO L382 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 43 treesize of output 82 [2020-12-22 19:21:58,846 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-12-22 19:21:58,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 19:21:58,848 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2020-12-22 19:21:58,943 INFO L625 ElimStorePlain]: treesize reduction 74, result has 58.4 percent of original size [2020-12-22 19:21:58,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:21:58,986 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:21:58,987 INFO L382 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 51 treesize of output 86 [2020-12-22 19:21:58,989 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-22 19:21:58,990 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:21:58,992 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2020-12-22 19:21:59,116 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2020-12-22 19:21:59,116 INFO L625 ElimStorePlain]: treesize reduction 82, result has 50.3 percent of original size [2020-12-22 19:21:59,118 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:59,119 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:59,120 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2020-12-22 19:21:59,120 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:177, output treesize:83 [2020-12-22 19:21:59,121 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:59,122 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:59,255 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:59,308 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:59,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:59,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:59,479 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:59,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:59,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:59,651 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:59,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:59,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:21:59,835 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:22:00,220 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 5, 1] term [2020-12-22 19:22:00,220 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 19:22:00,221 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 19:22:00,919 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2020-12-22 19:22:00,925 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 19:22:00,947 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:00,947 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-12-22 19:22:00,949 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-22 19:22:00,964 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:00,964 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-12-22 19:22:00,966 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-22 19:22:00,979 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:00,979 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-12-22 19:22:00,980 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2020-12-22 19:22:01,048 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:01,051 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 19:22:01,052 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 19:22:01,053 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 19:22:01,054 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2020-12-22 19:22:01,054 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:138, output treesize:108 [2020-12-22 19:22:01,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 19:22:01,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 19:22:01,059 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 19:22:01,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 19:22:01,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 19:22:01,489 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2020-12-22 19:22:01,498 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 19:22:01,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:22:01,524 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2020-12-22 19:22:01,527 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:01,542 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-12-22 19:22:01,543 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:01,564 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:01,564 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 37 [2020-12-22 19:22:01,566 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2020-12-22 19:22:01,603 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:01,608 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-12-22 19:22:01,608 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:92, output treesize:21 [2020-12-22 19:22:01,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:22:01,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 19:22:01,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 32 [2020-12-22 19:22:01,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659067464] [2020-12-22 19:22:01,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-12-22 19:22:01,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:22:01,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-12-22 19:22:01,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2020-12-22 19:22:01,686 INFO L87 Difference]: Start difference. First operand 189 states and 201 transitions. Second operand 32 states. [2020-12-22 19:22:02,795 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2020-12-22 19:22:03,089 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 26 [2020-12-22 19:22:03,740 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2020-12-22 19:22:04,041 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2020-12-22 19:22:04,260 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2020-12-22 19:22:04,628 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-12-22 19:22:04,851 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2020-12-22 19:22:05,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:22:05,911 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions. [2020-12-22 19:22:05,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-22 19:22:05,912 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 49 [2020-12-22 19:22:05,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:22:05,914 INFO L225 Difference]: With dead ends: 215 [2020-12-22 19:22:05,915 INFO L226 Difference]: Without dead ends: 215 [2020-12-22 19:22:05,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=396, Invalid=2256, Unknown=0, NotChecked=0, Total=2652 [2020-12-22 19:22:05,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-12-22 19:22:05,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 189. [2020-12-22 19:22:05,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-12-22 19:22:05,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 200 transitions. [2020-12-22 19:22:05,921 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 200 transitions. Word has length 49 [2020-12-22 19:22:05,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:22:05,921 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 200 transitions. [2020-12-22 19:22:05,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-12-22 19:22:05,921 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 200 transitions. [2020-12-22 19:22:05,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-22 19:22:05,922 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:22:05,922 INFO L422 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, 1, 1] [2020-12-22 19:22:06,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2020-12-22 19:22:06,136 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:22:06,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:22:06,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1402392779, now seen corresponding path program 1 times [2020-12-22 19:22:06,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:22:06,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384165300] [2020-12-22 19:22:06,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:22:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:22:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:22:06,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384165300] [2020-12-22 19:22:06,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761491337] [2020-12-22 19:22:06,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:22:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:22:06,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 45 conjunts are in the unsatisfiable core [2020-12-22 19:22:06,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 19:22:06,749 INFO L382 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 [2020-12-22 19:22:06,750 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:06,755 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:06,756 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:22:06,756 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-22 19:22:06,872 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:06,873 INFO L382 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 39 [2020-12-22 19:22:06,874 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:22:06,877 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:06,892 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:06,893 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:22:06,893 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-12-22 19:22:06,958 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-22 19:22:06,960 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:06,977 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:06,978 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:22:06,979 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2020-12-22 19:22:07,142 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:07,143 INFO L382 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 57 [2020-12-22 19:22:07,145 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-22 19:22:07,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:22:07,147 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-22 19:22:07,189 INFO L625 ElimStorePlain]: treesize reduction 33, result has 57.7 percent of original size [2020-12-22 19:22:07,190 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:22:07,190 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2020-12-22 19:22:07,474 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:07,475 INFO L382 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 110 [2020-12-22 19:22:07,478 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:07,519 INFO L625 ElimStorePlain]: treesize reduction 21, result has 69.1 percent of original size [2020-12-22 19:22:07,521 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:22:07,521 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:32 [2020-12-22 19:22:07,602 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-12-22 19:22:07,602 INFO L382 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 [2020-12-22 19:22:07,603 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:07,616 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:07,616 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:22:07,617 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:32 [2020-12-22 19:22:07,655 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:07,655 INFO L382 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 22 treesize of output 69 [2020-12-22 19:22:07,657 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 19:22:07,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:22:07,660 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:07,684 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:07,685 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:22:07,685 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:45 [2020-12-22 19:22:07,780 INFO L382 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 26 treesize of output 21 [2020-12-22 19:22:07,782 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:07,801 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:07,803 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:22:07,803 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:50 [2020-12-22 19:22:07,997 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:07,998 INFO L382 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 54 treesize of output 99 [2020-12-22 19:22:08,001 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-12-22 19:22:08,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:22:08,003 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:08,026 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:08,027 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:22:08,028 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:63 [2020-12-22 19:22:08,427 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-12-22 19:22:08,428 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:08,428 INFO L382 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 183 [2020-12-22 19:22:08,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:22:08,433 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-22 19:22:08,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 19:22:08,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 19:22:08,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:22:08,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:22:08,437 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:22:08,437 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 19:22:08,443 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:22:08,505 INFO L625 ElimStorePlain]: treesize reduction 16, result has 83.3 percent of original size [2020-12-22 19:22:08,507 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:22:08,507 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:110, output treesize:61 [2020-12-22 19:22:08,737 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2020-12-22 19:22:08,740 INFO L348 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2020-12-22 19:22:08,741 INFO L382 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 148 [2020-12-22 19:22:08,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:22:08,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 19:22:08,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:22:08,745 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:22:08,747 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-12-22 19:22:08,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:22:08,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-22 19:22:08,748 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-22 19:22:08,748 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-22 19:22:08,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:22:08,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:22:08,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:22:08,751 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-22 19:22:08,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:22:08,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-22 19:22:08,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:22:08,754 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-22 19:22:08,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:22:08,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:22:08,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:22:08,757 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-22 19:22:08,758 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-22 19:22:08,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:22:08,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:22:08,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:22:08,766 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-22 19:22:08,767 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:22:08,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-22 19:22:08,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:22:08,769 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-22 19:22:08,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:22:08,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:22:08,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:22:08,777 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2020-12-22 19:22:08,865 INFO L625 ElimStorePlain]: treesize reduction 667, result has 10.9 percent of original size [2020-12-22 19:22:08,867 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 19:22:08,867 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:125, output treesize:82 [2020-12-22 19:22:09,173 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:09,174 INFO L382 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 71 [2020-12-22 19:22:09,176 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:22:09,177 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:22:09,178 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:22:09,180 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:22:09,196 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:09,199 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 19:22:09,200 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:92, output treesize:28 [2020-12-22 19:22:09,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:22:09,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 19:22:09,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 39 [2020-12-22 19:22:09,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524950247] [2020-12-22 19:22:09,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2020-12-22 19:22:09,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:22:09,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-12-22 19:22:09,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1332, Unknown=0, NotChecked=0, Total=1560 [2020-12-22 19:22:09,397 INFO L87 Difference]: Start difference. First operand 189 states and 200 transitions. Second operand 40 states. [2020-12-22 19:22:27,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:22:27,369 INFO L93 Difference]: Finished difference Result 273 states and 290 transitions. [2020-12-22 19:22:27,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-12-22 19:22:27,370 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 50 [2020-12-22 19:22:27,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:22:27,372 INFO L225 Difference]: With dead ends: 273 [2020-12-22 19:22:27,372 INFO L226 Difference]: Without dead ends: 273 [2020-12-22 19:22:27,373 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=660, Invalid=3120, Unknown=2, NotChecked=0, Total=3782 [2020-12-22 19:22:27,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-12-22 19:22:27,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 197. [2020-12-22 19:22:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-12-22 19:22:27,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 210 transitions. [2020-12-22 19:22:27,379 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 210 transitions. Word has length 50 [2020-12-22 19:22:27,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:22:27,379 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 210 transitions. [2020-12-22 19:22:27,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2020-12-22 19:22:27,379 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 210 transitions. [2020-12-22 19:22:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-22 19:22:27,380 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:22:27,380 INFO L422 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, 1, 1] [2020-12-22 19:22:27,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:22:27,597 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:22:27,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:22:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1402392778, now seen corresponding path program 1 times [2020-12-22 19:22:27,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:22:27,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913081636] [2020-12-22 19:22:27,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:22:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:22:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:22:28,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913081636] [2020-12-22 19:22:28,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983138864] [2020-12-22 19:22:28,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:22:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:22:28,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 62 conjunts are in the unsatisfiable core [2020-12-22 19:22:28,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 19:22:28,371 INFO L382 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 [2020-12-22 19:22:28,372 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:28,377 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:28,378 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:22:28,378 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-22 19:22:28,507 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:28,508 INFO L382 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 39 [2020-12-22 19:22:28,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:22:28,512 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:28,527 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:28,528 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:22:28,528 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2020-12-22 19:22:28,596 INFO L382 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 [2020-12-22 19:22:28,597 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:28,617 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:28,627 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-22 19:22:28,628 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:28,657 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:28,658 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:22:28,659 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2020-12-22 19:22:28,835 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:28,835 INFO L382 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 60 treesize of output 70 [2020-12-22 19:22:28,838 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-22 19:22:28,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 19:22:28,841 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-22 19:22:28,902 INFO L625 ElimStorePlain]: treesize reduction 46, result has 61.3 percent of original size [2020-12-22 19:22:28,908 INFO L382 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 24 [2020-12-22 19:22:28,910 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:28,936 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:28,937 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:22:28,938 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:65 [2020-12-22 19:22:29,302 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:29,302 INFO L382 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 62 treesize of output 119 [2020-12-22 19:22:29,307 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:29,403 INFO L625 ElimStorePlain]: treesize reduction 21, result has 78.6 percent of original size [2020-12-22 19:22:29,429 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:29,430 INFO L382 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 28 treesize of output 52 [2020-12-22 19:22:29,432 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:29,525 INFO L625 ElimStorePlain]: treesize reduction 16, result has 83.2 percent of original size [2020-12-22 19:22:29,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:22:29,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:22:29,529 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:22:29,529 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:49 [2020-12-22 19:22:29,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:22:29,629 INFO L382 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 [2020-12-22 19:22:29,635 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:29,671 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:29,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:22:29,677 INFO L382 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 [2020-12-22 19:22:29,679 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:29,707 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:29,708 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:22:29,709 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2020-12-22 19:22:29,811 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_65|], 3=[|v_#valid_98|]} [2020-12-22 19:22:29,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:22:29,817 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2020-12-22 19:22:29,819 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:29,855 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:29,876 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:29,876 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-22 19:22:29,877 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 19:22:29,879 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:22:29,880 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:29,912 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:29,913 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:22:29,914 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2020-12-22 19:22:30,014 INFO L382 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 26 treesize of output 21 [2020-12-22 19:22:30,015 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:30,055 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:30,060 INFO L382 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 26 treesize of output 21 [2020-12-22 19:22:30,066 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:30,094 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:30,096 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:22:30,096 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2020-12-22 19:22:30,280 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_52|], 6=[|v_#memory_$Pointer$.base_74|]} [2020-12-22 19:22:30,286 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2020-12-22 19:22:30,287 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:30,318 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:30,371 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:30,371 INFO L382 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 67 treesize of output 108 [2020-12-22 19:22:30,374 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-12-22 19:22:30,374 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-22 19:22:30,376 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:30,409 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:30,411 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:22:30,411 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:83 [2020-12-22 19:22:30,747 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_53|], 12=[|v_#memory_$Pointer$.base_75|]} [2020-12-22 19:22:30,769 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:30,769 INFO L382 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 1 case distinctions, treesize of input 36 treesize of output 68 [2020-12-22 19:22:30,771 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:30,885 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2020-12-22 19:22:30,886 INFO L625 ElimStorePlain]: treesize reduction 24, result has 86.0 percent of original size [2020-12-22 19:22:31,016 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-12-22 19:22:31,016 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:31,017 INFO L382 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 200 [2020-12-22 19:22:31,021 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:22:31,022 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-22 19:22:31,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:22:31,023 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:22:31,023 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 19:22:31,024 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 19:22:31,024 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 19:22:31,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:22:31,030 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:22:31,120 INFO L625 ElimStorePlain]: treesize reduction 16, result has 87.2 percent of original size [2020-12-22 19:22:31,122 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:22:31,123 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:22:31,125 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:22:31,125 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:145, output treesize:75 [2020-12-22 19:22:31,237 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_54|], 12=[|v_#memory_$Pointer$.base_76|]} [2020-12-22 19:22:31,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:22:31,244 INFO L382 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 66 treesize of output 29 [2020-12-22 19:22:31,246 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:31,283 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:31,427 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2020-12-22 19:22:31,427 INFO L348 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2020-12-22 19:22:31,428 INFO L382 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 157 [2020-12-22 19:22:31,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:22:31,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 19:22:31,433 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-22 19:22:31,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:22:31,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 19:22:31,436 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-12-22 19:22:31,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-22 19:22:31,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-22 19:22:31,437 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:31,467 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:31,469 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 19:22:31,469 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:190, output treesize:104 [2020-12-22 19:22:31,857 INFO L443 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2020-12-22 19:22:31,862 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 30 treesize of output 10 [2020-12-22 19:22:31,864 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:22:31,901 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:31,932 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:31,933 INFO L382 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 73 [2020-12-22 19:22:31,936 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:22:31,936 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:22:31,938 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:22:31,964 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:22:31,967 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:22:31,968 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:121, output treesize:18 [2020-12-22 19:22:32,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:22:32,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 19:22:32,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 40 [2020-12-22 19:22:32,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528249640] [2020-12-22 19:22:32,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-12-22 19:22:32,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:22:32,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-12-22 19:22:32,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1502, Unknown=0, NotChecked=0, Total=1640 [2020-12-22 19:22:32,193 INFO L87 Difference]: Start difference. First operand 197 states and 210 transitions. Second operand 41 states. [2020-12-22 19:22:33,117 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2020-12-22 19:22:33,501 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2020-12-22 19:22:34,151 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2020-12-22 19:22:34,379 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2020-12-22 19:22:34,606 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2020-12-22 19:22:38,441 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 62 [2020-12-22 19:22:40,681 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2020-12-22 19:22:42,914 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 58 [2020-12-22 19:23:28,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:23:28,316 INFO L93 Difference]: Finished difference Result 278 states and 296 transitions. [2020-12-22 19:23:28,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-12-22 19:23:28,317 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 50 [2020-12-22 19:23:28,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:23:28,319 INFO L225 Difference]: With dead ends: 278 [2020-12-22 19:23:28,319 INFO L226 Difference]: Without dead ends: 278 [2020-12-22 19:23:28,321 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=563, Invalid=4397, Unknown=10, NotChecked=0, Total=4970 [2020-12-22 19:23:28,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-12-22 19:23:28,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 200. [2020-12-22 19:23:28,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-12-22 19:23:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 213 transitions. [2020-12-22 19:23:28,327 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 213 transitions. Word has length 50 [2020-12-22 19:23:28,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:23:28,327 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 213 transitions. [2020-12-22 19:23:28,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-12-22 19:23:28,327 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 213 transitions. [2020-12-22 19:23:28,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-22 19:23:28,328 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:23:28,328 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 19:23:28,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2020-12-22 19:23:28,544 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:23:28,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:23:28,545 INFO L82 PathProgramCache]: Analyzing trace with hash -168116933, now seen corresponding path program 2 times [2020-12-22 19:23:28,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:23:28,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503692717] [2020-12-22 19:23:28,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:23:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:23:28,936 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:23:28,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503692717] [2020-12-22 19:23:28,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880292716] [2020-12-22 19:23:28,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:23:29,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-22 19:23:29,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 19:23:29,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-22 19:23:29,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 19:23:29,196 INFO L382 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 [2020-12-22 19:23:29,197 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:23:29,204 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:29,205 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:23:29,205 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2020-12-22 19:23:29,249 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-22 19:23:29,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 19:23:29,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 23 [2020-12-22 19:23:29,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675877419] [2020-12-22 19:23:29,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 19:23:29,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:23:29,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 19:23:29,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2020-12-22 19:23:29,251 INFO L87 Difference]: Start difference. First operand 200 states and 213 transitions. Second operand 7 states. [2020-12-22 19:23:29,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:23:29,653 INFO L93 Difference]: Finished difference Result 197 states and 208 transitions. [2020-12-22 19:23:29,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 19:23:29,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2020-12-22 19:23:29,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:23:29,656 INFO L225 Difference]: With dead ends: 197 [2020-12-22 19:23:29,656 INFO L226 Difference]: Without dead ends: 197 [2020-12-22 19:23:29,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2020-12-22 19:23:29,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-12-22 19:23:29,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2020-12-22 19:23:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-12-22 19:23:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 207 transitions. [2020-12-22 19:23:29,662 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 207 transitions. Word has length 54 [2020-12-22 19:23:29,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:23:29,663 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 207 transitions. [2020-12-22 19:23:29,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 19:23:29,663 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 207 transitions. [2020-12-22 19:23:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-22 19:23:29,664 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:23:29,664 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 19:23:29,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:23:29,873 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:23:29,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:23:29,875 INFO L82 PathProgramCache]: Analyzing trace with hash 2033053266, now seen corresponding path program 2 times [2020-12-22 19:23:29,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:23:29,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079717010] [2020-12-22 19:23:29,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:23:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:23:30,896 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2020-12-22 19:23:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:23:31,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079717010] [2020-12-22 19:23:31,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466173327] [2020-12-22 19:23:31,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:23:31,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 19:23:31,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 19:23:31,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 47 conjunts are in the unsatisfiable core [2020-12-22 19:23:31,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 19:23:31,211 INFO L382 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 [2020-12-22 19:23:31,212 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:23:31,217 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:31,218 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:23:31,219 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-22 19:23:31,291 INFO L382 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 [2020-12-22 19:23:31,292 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:23:31,305 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:31,306 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:23:31,306 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-12-22 19:23:31,435 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:31,435 INFO L382 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 39 [2020-12-22 19:23:31,437 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:23:31,439 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:23:31,462 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:31,463 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:23:31,464 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:36 [2020-12-22 19:23:31,532 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_77|], 2=[|v_#memory_int_48|]} [2020-12-22 19:23:31,539 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-22 19:23:31,540 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:23:31,576 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:31,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:23:31,583 INFO L382 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 [2020-12-22 19:23:31,584 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:23:31,611 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:31,613 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:23:31,613 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:44 [2020-12-22 19:23:31,778 INFO L382 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 41 treesize of output 13 [2020-12-22 19:23:31,780 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:23:31,811 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:31,842 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:31,843 INFO L382 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 57 [2020-12-22 19:23:31,844 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-22 19:23:31,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:23:31,846 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-22 19:23:31,910 INFO L625 ElimStorePlain]: treesize reduction 33, result has 63.3 percent of original size [2020-12-22 19:23:31,912 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:23:31,912 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:57 [2020-12-22 19:23:32,031 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:32,032 INFO L382 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 38 treesize of output 33 [2020-12-22 19:23:32,035 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:23:32,056 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:32,058 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:23:32,058 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:30 [2020-12-22 19:23:32,194 INFO L382 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 [2020-12-22 19:23:32,195 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:23:32,211 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:32,212 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:23:32,213 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:30 [2020-12-22 19:23:32,229 INFO L382 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 [2020-12-22 19:23:32,230 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:23:32,253 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:32,254 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:23:32,254 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2020-12-22 19:23:32,369 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:32,369 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-22 19:23:32,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 19:23:32,372 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:23:32,373 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:23:32,395 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:32,396 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:23:32,396 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:37 [2020-12-22 19:23:32,478 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_79|], 6=[|v_#memory_int_52|]} [2020-12-22 19:23:32,485 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-22 19:23:32,486 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:23:32,518 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:32,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:23:32,525 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2020-12-22 19:23:32,527 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:23:32,551 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:32,553 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:23:32,553 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:45 [2020-12-22 19:23:32,716 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_80|], 6=[|v_#memory_int_53|]} [2020-12-22 19:23:32,745 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:32,746 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 75 [2020-12-22 19:23:32,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-22 19:23:32,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 19:23:32,750 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:23:32,779 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:32,784 INFO L382 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 50 treesize of output 25 [2020-12-22 19:23:32,786 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:23:32,810 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:32,817 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:23:32,817 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:58 [2020-12-22 19:23:32,929 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:32,930 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 32 [2020-12-22 19:23:32,931 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:23:32,951 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:32,953 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 19:23:32,953 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:65, output treesize:37 [2020-12-22 19:23:33,133 INFO L382 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 34 treesize of output 25 [2020-12-22 19:23:33,135 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:23:33,157 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:33,159 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 19:23:33,159 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:37 [2020-12-22 19:23:33,263 INFO L382 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 32 treesize of output 34 [2020-12-22 19:23:33,264 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:23:33,290 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:33,294 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-22 19:23:33,295 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:46 [2020-12-22 19:23:33,623 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2020-12-22 19:23:33,625 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:23:33,640 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:23:33,643 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:23:33,643 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:55, output treesize:3 [2020-12-22 19:23:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:23:33,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 19:23:33,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2020-12-22 19:23:33,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611901767] [2020-12-22 19:23:33,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 42 states [2020-12-22 19:23:33,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:23:33,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2020-12-22 19:23:33,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1490, Unknown=0, NotChecked=0, Total=1722 [2020-12-22 19:23:33,702 INFO L87 Difference]: Start difference. First operand 196 states and 207 transitions. Second operand 42 states. [2020-12-22 19:23:34,587 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2020-12-22 19:23:34,741 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2020-12-22 19:23:34,923 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2020-12-22 19:23:46,387 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2020-12-22 19:23:46,848 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-12-22 19:23:58,640 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2020-12-22 19:24:02,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:24:02,663 INFO L93 Difference]: Finished difference Result 358 states and 379 transitions. [2020-12-22 19:24:02,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-12-22 19:24:02,664 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 54 [2020-12-22 19:24:02,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:24:02,667 INFO L225 Difference]: With dead ends: 358 [2020-12-22 19:24:02,667 INFO L226 Difference]: Without dead ends: 358 [2020-12-22 19:24:02,668 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1476 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1054, Invalid=4348, Unknown=0, NotChecked=0, Total=5402 [2020-12-22 19:24:02,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2020-12-22 19:24:02,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 251. [2020-12-22 19:24:02,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2020-12-22 19:24:02,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 266 transitions. [2020-12-22 19:24:02,676 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 266 transitions. Word has length 54 [2020-12-22 19:24:02,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:24:02,676 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 266 transitions. [2020-12-22 19:24:02,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2020-12-22 19:24:02,676 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 266 transitions. [2020-12-22 19:24:02,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-22 19:24:02,677 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:24:02,677 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 19:24:02,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2020-12-22 19:24:02,892 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:24:02,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:24:02,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1187925495, now seen corresponding path program 2 times [2020-12-22 19:24:02,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:24:02,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123219899] [2020-12-22 19:24:02,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:24:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:24:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:24:03,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123219899] [2020-12-22 19:24:03,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919875523] [2020-12-22 19:24:03,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:24:03,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 19:24:03,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 19:24:03,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 67 conjunts are in the unsatisfiable core [2020-12-22 19:24:03,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 19:24:03,628 INFO L382 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 [2020-12-22 19:24:03,629 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:03,634 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:03,635 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:24:03,635 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-22 19:24:03,761 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:03,761 INFO L382 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 39 [2020-12-22 19:24:03,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:24:03,765 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:03,782 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:03,783 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:24:03,783 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-12-22 19:24:03,851 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-22 19:24:03,853 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:03,872 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:03,873 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:24:03,874 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2020-12-22 19:24:04,050 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:04,050 INFO L382 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 57 [2020-12-22 19:24:04,052 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-22 19:24:04,053 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:24:04,054 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-22 19:24:04,103 INFO L625 ElimStorePlain]: treesize reduction 33, result has 57.7 percent of original size [2020-12-22 19:24:04,104 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:24:04,105 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2020-12-22 19:24:04,386 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_55|], 6=[|v_#memory_$Pointer$.base_83|]} [2020-12-22 19:24:04,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:24:04,394 INFO L382 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 19 treesize of output 18 [2020-12-22 19:24:04,397 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:04,459 INFO L625 ElimStorePlain]: treesize reduction 5, result has 93.4 percent of original size [2020-12-22 19:24:04,535 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:04,535 INFO L382 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 110 [2020-12-22 19:24:04,538 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:04,611 INFO L625 ElimStorePlain]: treesize reduction 16, result has 79.2 percent of original size [2020-12-22 19:24:04,614 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:24:04,614 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:46 [2020-12-22 19:24:04,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:24:04,723 INFO L382 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 [2020-12-22 19:24:04,725 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:04,754 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:04,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:24:04,760 INFO L382 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 [2020-12-22 19:24:04,762 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:04,785 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:04,786 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:24:04,787 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:46 [2020-12-22 19:24:04,851 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:04,851 INFO L382 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 22 treesize of output 69 [2020-12-22 19:24:04,853 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 19:24:04,853 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:24:04,856 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:04,891 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:04,892 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:24:04,892 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:59 [2020-12-22 19:24:05,007 INFO L382 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 26 treesize of output 21 [2020-12-22 19:24:05,009 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:05,046 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:05,052 INFO L382 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 26 treesize of output 21 [2020-12-22 19:24:05,055 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:05,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:05,091 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:24:05,091 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2020-12-22 19:24:05,296 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_58|], 6=[|v_#memory_$Pointer$.base_86|]} [2020-12-22 19:24:05,302 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2020-12-22 19:24:05,304 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:05,334 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:05,388 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:05,388 INFO L382 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 67 treesize of output 108 [2020-12-22 19:24:05,390 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-12-22 19:24:05,390 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-22 19:24:05,391 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:05,426 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:05,427 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:24:05,428 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:83 [2020-12-22 19:24:05,827 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_59|], 12=[|v_#memory_$Pointer$.base_87|]} [2020-12-22 19:24:05,900 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:05,901 INFO L382 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 130 treesize of output 179 [2020-12-22 19:24:05,904 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:24:05,905 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-22 19:24:05,906 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:24:05,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:24:05,909 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-22 19:24:05,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 19:24:05,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:24:05,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:24:05,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:24:05,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 19:24:05,917 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:24:05,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:24:05,920 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:24:06,051 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2020-12-22 19:24:06,052 INFO L625 ElimStorePlain]: treesize reduction 48, result has 75.4 percent of original size [2020-12-22 19:24:06,189 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-12-22 19:24:06,190 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:06,191 INFO L382 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 198 [2020-12-22 19:24:06,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:24:06,196 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:24:06,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:24:06,198 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-22 19:24:06,199 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:24:06,200 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 19:24:06,204 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:24:06,313 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2020-12-22 19:24:06,314 INFO L625 ElimStorePlain]: treesize reduction 16, result has 87.2 percent of original size [2020-12-22 19:24:06,316 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:24:06,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:24:06,319 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:24:06,319 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:166, output treesize:72 [2020-12-22 19:24:06,444 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_60|], 12=[|v_#memory_$Pointer$.base_88|]} [2020-12-22 19:24:06,515 INFO L348 Elim1Store]: treesize reduction 46, result has 55.3 percent of original size [2020-12-22 19:24:06,515 INFO L382 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 202 treesize of output 193 [2020-12-22 19:24:06,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:24:06,519 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:06,558 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:06,730 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2020-12-22 19:24:06,732 INFO L348 Elim1Store]: treesize reduction 54, result has 69.3 percent of original size [2020-12-22 19:24:06,733 INFO L382 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 175 [2020-12-22 19:24:06,736 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:24:06,737 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-22 19:24:06,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 19:24:06,739 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:24:06,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:24:06,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:24:06,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 19:24:06,742 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 19:24:06,743 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-12-22 19:24:06,743 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-22 19:24:06,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-22 19:24:06,746 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:06,774 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:06,776 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:24:06,776 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:227, output treesize:117 [2020-12-22 19:24:07,130 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:07,130 INFO L382 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 99 treesize of output 86 [2020-12-22 19:24:07,133 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:07,153 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:07,155 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 19:24:07,155 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:128, output treesize:86 [2020-12-22 19:24:07,448 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:07,448 INFO L382 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 71 [2020-12-22 19:24:07,451 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 19:24:07,452 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:24:07,452 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:24:07,455 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:24:07,469 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:07,471 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 19:24:07,472 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2020-12-22 19:24:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:24:07,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 19:24:07,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 42 [2020-12-22 19:24:07,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249209328] [2020-12-22 19:24:07,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 43 states [2020-12-22 19:24:07,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:24:07,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2020-12-22 19:24:07,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1584, Unknown=0, NotChecked=0, Total=1806 [2020-12-22 19:24:07,725 INFO L87 Difference]: Start difference. First operand 251 states and 266 transitions. Second operand 43 states. [2020-12-22 19:24:21,388 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2020-12-22 19:24:25,781 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2020-12-22 19:24:33,816 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2020-12-22 19:24:35,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 19:24:35,624 INFO L93 Difference]: Finished difference Result 311 states and 329 transitions. [2020-12-22 19:24:35,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-12-22 19:24:35,625 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 55 [2020-12-22 19:24:35,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 19:24:35,627 INFO L225 Difference]: With dead ends: 311 [2020-12-22 19:24:35,627 INFO L226 Difference]: Without dead ends: 311 [2020-12-22 19:24:35,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=571, Invalid=3584, Unknown=5, NotChecked=0, Total=4160 [2020-12-22 19:24:35,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-12-22 19:24:35,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 254. [2020-12-22 19:24:35,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-22 19:24:35,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 271 transitions. [2020-12-22 19:24:35,635 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 271 transitions. Word has length 55 [2020-12-22 19:24:35,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 19:24:35,636 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 271 transitions. [2020-12-22 19:24:35,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2020-12-22 19:24:35,636 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 271 transitions. [2020-12-22 19:24:35,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-22 19:24:35,637 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 19:24:35,637 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 19:24:35,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:24:35,852 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2020-12-22 19:24:35,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 19:24:35,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1187925496, now seen corresponding path program 2 times [2020-12-22 19:24:35,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 19:24:35,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015515968] [2020-12-22 19:24:35,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 19:24:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 19:24:36,655 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:24:36,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015515968] [2020-12-22 19:24:36,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193843539] [2020-12-22 19:24:36,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 19:24:36,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 19:24:36,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 19:24:36,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 76 conjunts are in the unsatisfiable core [2020-12-22 19:24:36,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 19:24:36,786 INFO L382 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 [2020-12-22 19:24:36,787 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:36,793 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:36,794 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:24:36,795 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-22 19:24:36,904 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_66|], 3=[|v_#valid_107|]} [2020-12-22 19:24:36,909 INFO L382 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 [2020-12-22 19:24:36,910 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:36,934 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:36,960 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:36,961 INFO L382 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 39 [2020-12-22 19:24:36,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:24:36,964 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:36,985 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:36,986 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:24:36,987 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2020-12-22 19:24:37,069 INFO L382 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 [2020-12-22 19:24:37,070 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:37,094 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:37,100 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-22 19:24:37,101 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:37,123 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:37,125 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:24:37,125 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2020-12-22 19:24:37,291 INFO L382 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 24 [2020-12-22 19:24:37,292 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:37,323 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:37,351 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:37,351 INFO L382 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 61 treesize of output 71 [2020-12-22 19:24:37,353 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-22 19:24:37,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:24:37,356 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-22 19:24:37,423 INFO L625 ElimStorePlain]: treesize reduction 47, result has 61.2 percent of original size [2020-12-22 19:24:37,425 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:24:37,425 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:74 [2020-12-22 19:24:37,555 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2020-12-22 19:24:37,557 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:37,579 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:37,581 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:24:37,581 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:82, output treesize:58 [2020-12-22 19:24:37,854 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:37,855 INFO L382 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 58 treesize of output 107 [2020-12-22 19:24:37,858 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:37,932 INFO L625 ElimStorePlain]: treesize reduction 21, result has 72.4 percent of original size [2020-12-22 19:24:37,934 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:24:37,934 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:40 [2020-12-22 19:24:38,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:24:38,037 INFO L382 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 [2020-12-22 19:24:38,038 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:38,059 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:38,060 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:24:38,060 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:40 [2020-12-22 19:24:38,077 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_67|], 3=[|v_#valid_108|]} [2020-12-22 19:24:38,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:24:38,085 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2020-12-22 19:24:38,087 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:38,116 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:38,137 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:38,137 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-22 19:24:38,139 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 19:24:38,140 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:24:38,142 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:38,171 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:38,172 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:24:38,173 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2020-12-22 19:24:38,271 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_63|], 6=[|v_#memory_$Pointer$.base_93|]} [2020-12-22 19:24:38,278 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-22 19:24:38,279 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:38,315 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:38,322 INFO L382 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 26 treesize of output 21 [2020-12-22 19:24:38,324 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:38,383 INFO L625 ElimStorePlain]: treesize reduction 4, result has 92.5 percent of original size [2020-12-22 19:24:38,384 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:24:38,385 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:51 [2020-12-22 19:24:38,588 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_64|], 6=[|v_#memory_$Pointer$.base_94|]} [2020-12-22 19:24:38,594 INFO L382 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 36 treesize of output 27 [2020-12-22 19:24:38,596 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:38,640 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:38,707 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:38,708 INFO L382 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 67 treesize of output 116 [2020-12-22 19:24:38,712 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 1] term [2020-12-22 19:24:38,713 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-22 19:24:38,715 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:38,800 INFO L625 ElimStorePlain]: treesize reduction 4, result has 95.7 percent of original size [2020-12-22 19:24:38,802 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:24:38,803 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:105, output treesize:89 [2020-12-22 19:24:39,221 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_65|], 12=[|v_#memory_$Pointer$.base_95|]} [2020-12-22 19:24:39,248 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:39,248 INFO L382 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 1 case distinctions, treesize of input 51 treesize of output 75 [2020-12-22 19:24:39,250 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:39,370 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-12-22 19:24:39,371 INFO L625 ElimStorePlain]: treesize reduction 30, result has 83.1 percent of original size [2020-12-22 19:24:39,491 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-12-22 19:24:39,492 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:39,493 INFO L382 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 133 treesize of output 198 [2020-12-22 19:24:39,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-22 19:24:39,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:24:39,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:24:39,498 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-22 19:24:39,505 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-22 19:24:39,621 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2020-12-22 19:24:39,622 INFO L625 ElimStorePlain]: treesize reduction 24, result has 82.1 percent of original size [2020-12-22 19:24:39,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 19:24:39,626 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 19:24:39,626 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:152, output treesize:110 [2020-12-22 19:24:39,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 19:24:39,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 19:24:39,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:24:39,814 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:24:39,815 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-12-22 19:24:39,819 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-12-22 19:24:39,831 INFO L443 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_66|], 20=[|v_#memory_$Pointer$.base_96|]} [2020-12-22 19:24:39,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:24:39,905 INFO L348 Elim1Store]: treesize reduction 40, result has 47.4 percent of original size [2020-12-22 19:24:39,905 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 74 [2020-12-22 19:24:39,908 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:39,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:24:39,925 INFO L382 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 83 treesize of output 38 [2020-12-22 19:24:39,927 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:40,067 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-12-22 19:24:40,068 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:40,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:24:40,260 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-22 19:24:40,261 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:40,262 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 190 treesize of output 282 [2020-12-22 19:24:40,268 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[14, 3, 2, 1] term [2020-12-22 19:24:40,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-12-22 19:24:40,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 18 disjuncts [2020-12-22 19:24:40,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 18 disjuncts [2020-12-22 19:24:40,270 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 17 disjuncts [2020-12-22 19:24:40,281 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2020-12-22 19:24:40,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:24:40,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:24:40,317 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:24:40,318 INFO L382 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 119 [2020-12-22 19:24:40,322 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-22 19:24:40,649 WARN L197 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2020-12-22 19:24:40,650 INFO L625 ElimStorePlain]: treesize reduction 113, result has 76.7 percent of original size [2020-12-22 19:24:40,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:24:40,656 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-12-22 19:24:40,656 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:433, output treesize:370 [2020-12-22 19:24:40,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:24:42,904 WARN L197 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 65 [2020-12-22 19:24:42,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:24:43,097 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:24:43,280 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:24:43,463 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:24:43,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:24:43,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:24:44,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:24:44,229 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:24:44,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:24:44,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:24:44,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 19:24:45,306 WARN L197 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-12-22 19:24:46,755 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 19:24:46,763 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 8, 1] term [2020-12-22 19:24:46,764 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 19:24:47,528 WARN L197 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-12-22 19:24:49,657 WARN L197 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 102 [2020-12-22 19:25:02,173 WARN L197 SmtUtils]: Spent 12.24 s on a formula simplification that was a NOOP. DAG size: 109 [2020-12-22 19:25:02,202 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 19:25:02,215 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 19:25:02,223 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 19:25:02,234 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 19:25:02,243 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-22 19:25:02,262 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-22 19:25:02,289 INFO L443 ElimStorePlain]: Different costs {6=[v_prenex_24, v_prenex_22], 11=[v_prenex_23, v_prenex_21], 12=[|#memory_$Pointer$.offset|], 19=[|#memory_$Pointer$.base|]} [2020-12-22 19:25:02,300 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-22 19:25:02,301 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 15 [2020-12-22 19:25:02,303 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 19:25:02,462 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-12-22 19:25:02,463 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:25:02,472 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-22 19:25:02,473 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 13 [2020-12-22 19:25:02,475 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 19:25:02,630 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-12-22 19:25:02,631 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:25:02,726 INFO L348 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2020-12-22 19:25:02,726 INFO L382 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 90 [2020-12-22 19:25:02,730 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-22 19:25:02,730 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-22 19:25:02,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:02,731 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:02,732 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:02,732 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:02,733 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-22 19:25:02,734 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-22 19:25:02,734 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:02,735 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-22 19:25:02,735 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-22 19:25:02,736 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:02,736 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-22 19:25:02,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:02,737 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:02,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:02,739 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:02,740 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-22 19:25:02,740 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:02,741 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-22 19:25:02,742 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:02,743 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:02,744 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:02,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:25:02,745 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:02,746 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:02,747 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:02,747 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-22 19:25:02,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:02,751 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:02,752 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:02,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:25:02,754 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:02,755 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:02,756 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:02,757 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-22 19:25:02,760 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-22 19:25:02,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:02,761 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:02,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:02,762 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:02,763 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-22 19:25:02,763 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:02,764 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-22 19:25:02,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:02,765 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:02,765 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:02,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:25:02,767 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:02,768 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:02,769 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:02,770 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-22 19:25:02,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:02,772 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:02,773 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:02,774 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:25:02,774 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:02,775 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:02,776 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:02,776 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-22 19:25:02,780 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 19:25:02,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:25:02,782 INFO L547 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 19:25:03,062 WARN L197 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2020-12-22 19:25:03,063 INFO L625 ElimStorePlain]: treesize reduction 5, result has 98.5 percent of original size [2020-12-22 19:25:03,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:25:03,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 19:25:03,104 INFO L348 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2020-12-22 19:25:03,105 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 54 [2020-12-22 19:25:03,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 19:25:03,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:25:03,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 19:25:03,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:25:03,113 INFO L547 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 19:25:03,382 WARN L197 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2020-12-22 19:25:03,383 INFO L625 ElimStorePlain]: treesize reduction 5, result has 98.2 percent of original size [2020-12-22 19:25:03,392 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-22 19:25:03,401 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:25:03,402 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 26 [2020-12-22 19:25:03,404 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-22 19:25:03,525 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-22 19:25:03,525 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 19:25:03,722 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-12-22 19:25:03,723 INFO L348 Elim1Store]: treesize reduction 12, result has 89.7 percent of original size [2020-12-22 19:25:03,723 INFO L382 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 109 treesize of output 145 [2020-12-22 19:25:03,727 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-22 19:25:03,727 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:25:03,728 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-22 19:25:03,729 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:03,729 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:03,730 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-22 19:25:03,730 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-22 19:25:03,730 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-22 19:25:03,731 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-22 19:25:03,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:03,732 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-12-22 19:25:03,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:25:03,733 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-22 19:25:03,733 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:03,734 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:03,735 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-22 19:25:03,735 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-22 19:25:03,735 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-22 19:25:03,736 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:03,736 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-22 19:25:03,737 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-22 19:25:03,737 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-22 19:25:03,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:03,739 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-22 19:25:03,739 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:03,739 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:03,740 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-22 19:25:03,740 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-22 19:25:03,741 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-22 19:25:03,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:03,742 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-22 19:25:03,743 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:03,743 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:03,744 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-22 19:25:03,744 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-22 19:25:03,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:03,745 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-22 19:25:03,746 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:03,746 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-22 19:25:03,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:03,747 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-22 19:25:03,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:03,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:03,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:25:03,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:03,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:25:03,753 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-22 19:25:03,754 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:03,755 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-22 19:25:03,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:03,756 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-22 19:25:03,758 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 19:25:03,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:03,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-22 19:25:03,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:03,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 19:25:03,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 19:25:03,763 INFO L547 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 19:25:03,991 WARN L197 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2020-12-22 19:25:03,992 INFO L625 ElimStorePlain]: treesize reduction 5, result has 96.8 percent of original size [2020-12-22 19:25:04,006 INFO L547 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2020-12-22 19:25:04,007 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 14 variables, input treesize:475, output treesize:85 [2020-12-22 19:25:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 19:25:04,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 19:25:04,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24] total 43 [2020-12-22 19:25:04,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383546614] [2020-12-22 19:25:04,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-12-22 19:25:04,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 19:25:04,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-12-22 19:25:04,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1740, Unknown=0, NotChecked=0, Total=1892 [2020-12-22 19:25:04,367 INFO L87 Difference]: Start difference. First operand 254 states and 271 transitions. Second operand 44 states. [2020-12-22 19:25:07,540 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56