/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/termination-crafted/4BitCounterPointer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 05:47:47,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 05:47:47,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 05:47:47,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 05:47:47,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 05:47:47,734 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 05:47:47,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 05:47:47,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 05:47:47,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 05:47:47,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 05:47:47,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 05:47:47,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 05:47:47,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 05:47:47,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 05:47:47,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 05:47:47,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 05:47:47,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 05:47:47,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 05:47:47,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 05:47:47,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 05:47:47,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 05:47:47,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 05:47:47,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 05:47:47,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 05:47:47,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 05:47:47,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 05:47:47,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 05:47:47,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 05:47:47,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 05:47:47,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 05:47:47,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 05:47:47,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 05:47:47,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 05:47:47,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 05:47:47,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 05:47:47,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 05:47:47,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 05:47:47,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 05:47:47,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 05:47:47,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 05:47:47,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 05:47:47,827 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2021-01-07 05:47:47,853 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 05:47:47,854 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 05:47:47,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 05:47:47,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 05:47:47,856 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 05:47:47,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 05:47:47,857 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-01-07 05:47:47,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 05:47:47,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 05:47:47,857 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-01-07 05:47:47,857 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-01-07 05:47:47,858 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-01-07 05:47:47,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 05:47:47,858 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-01-07 05:47:47,858 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 05:47:47,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 05:47:47,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 05:47:47,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 05:47:47,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:47:47,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 05:47:47,860 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 05:47:47,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 05:47:47,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 05:47:47,860 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 05:47:47,861 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-bitabs/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 [2021-01-07 05:47:48,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 05:47:48,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 05:47:48,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 05:47:48,313 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 05:47:48,314 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 05:47:48,315 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2021-01-07 05:47:48,412 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c7e0ec409/9f4f4a4b5bd6413981b0fb6b204e4e1e/FLAG69112b6fa [2021-01-07 05:47:49,125 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 05:47:49,126 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2021-01-07 05:47:49,133 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c7e0ec409/9f4f4a4b5bd6413981b0fb6b204e4e1e/FLAG69112b6fa [2021-01-07 05:47:49,485 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c7e0ec409/9f4f4a4b5bd6413981b0fb6b204e4e1e [2021-01-07 05:47:49,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 05:47:49,490 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 05:47:49,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 05:47:49,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 05:47:49,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 05:47:49,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:47:49" (1/1) ... [2021-01-07 05:47:49,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a74417f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:47:49, skipping insertion in model container [2021-01-07 05:47:49,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:47:49" (1/1) ... [2021-01-07 05:47:49,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 05:47:49,521 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: IdentifierExpression[~x0~0,] left hand side expression in assignment: address: IdentifierExpression[~x1~0,] left hand side expression in assignment: address: IdentifierExpression[~x2~0,] left hand side expression in assignment: address: IdentifierExpression[~x3~0,] left hand side expression in assignment: address: IdentifierExpression[~x0~0,] left hand side expression in assignment: address: IdentifierExpression[~x0~0,] left hand side expression in assignment: address: IdentifierExpression[~x1~0,] left hand side expression in assignment: address: IdentifierExpression[~x1~0,] left hand side expression in assignment: address: IdentifierExpression[~x2~0,] left hand side expression in assignment: address: IdentifierExpression[~x2~0,] left hand side expression in assignment: address: IdentifierExpression[~x3~0,] [2021-01-07 05:47:49,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:47:49,693 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: IdentifierExpression[~x0~0,] left hand side expression in assignment: address: IdentifierExpression[~x1~0,] left hand side expression in assignment: address: IdentifierExpression[~x2~0,] left hand side expression in assignment: address: IdentifierExpression[~x3~0,] left hand side expression in assignment: address: IdentifierExpression[~x0~0,] left hand side expression in assignment: address: IdentifierExpression[~x0~0,] left hand side expression in assignment: address: IdentifierExpression[~x1~0,] left hand side expression in assignment: address: IdentifierExpression[~x1~0,] left hand side expression in assignment: address: IdentifierExpression[~x2~0,] left hand side expression in assignment: address: IdentifierExpression[~x2~0,] left hand side expression in assignment: address: IdentifierExpression[~x3~0,] [2021-01-07 05:47:49,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:47:49,730 INFO L208 MainTranslator]: Completed translation [2021-01-07 05:47:49,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:47:49 WrapperNode [2021-01-07 05:47:49,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 05:47:49,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 05:47:49,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 05:47:49,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 05:47:49,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:47:49" (1/1) ... [2021-01-07 05:47:49,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:47:49" (1/1) ... [2021-01-07 05:47:49,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 05:47:49,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 05:47:49,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 05:47:49,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 05:47:49,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:47:49" (1/1) ... [2021-01-07 05:47:49,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:47:49" (1/1) ... [2021-01-07 05:47:49,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:47:49" (1/1) ... [2021-01-07 05:47:49,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:47:49" (1/1) ... [2021-01-07 05:47:49,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:47:49" (1/1) ... [2021-01-07 05:47:49,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:47:49" (1/1) ... [2021-01-07 05:47:49,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:47:49" (1/1) ... [2021-01-07 05:47:49,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 05:47:49,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 05:47:49,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 05:47:49,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 05:47:49,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:47:49" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-07 05:47:49,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 05:47:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 05:47:49,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 05:47:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 05:47:49,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 05:47:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 05:47:50,675 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 05:47:50,676 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-01-07 05:47:50,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:47:50 BoogieIcfgContainer [2021-01-07 05:47:50,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 05:47:50,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 05:47:50,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 05:47:50,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 05:47:50,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 05:47:49" (1/3) ... [2021-01-07 05:47:50,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6697027c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:47:50, skipping insertion in model container [2021-01-07 05:47:50,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:47:49" (2/3) ... [2021-01-07 05:47:50,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6697027c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:47:50, skipping insertion in model container [2021-01-07 05:47:50,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:47:50" (3/3) ... [2021-01-07 05:47:50,688 INFO L111 eAbstractionObserver]: Analyzing ICFG 4BitCounterPointer.c [2021-01-07 05:47:50,697 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 05:47:50,703 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2021-01-07 05:47:50,725 INFO L253 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2021-01-07 05:47:50,753 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 05:47:50,753 INFO L378 AbstractCegarLoop]: Hoare is false [2021-01-07 05:47:50,753 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 05:47:50,754 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 05:47:50,754 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 05:47:50,754 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 05:47:50,754 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 05:47:50,754 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 05:47:50,772 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2021-01-07 05:47:50,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-01-07 05:47:50,780 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:47:50,781 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-01-07 05:47:50,781 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:47:50,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:47:50,788 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-01-07 05:47:50,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:47:50,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482049607] [2021-01-07 05:47:50,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:47:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:47:51,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:47:51,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482049607] [2021-01-07 05:47:51,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:47:51,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:47:51,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705192318] [2021-01-07 05:47:51,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:47:51,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:47:51,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:47:51,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:47:51,047 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2021-01-07 05:47:51,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:47:51,179 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2021-01-07 05:47:51,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:47:51,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2021-01-07 05:47:51,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:47:51,193 INFO L225 Difference]: With dead ends: 52 [2021-01-07 05:47:51,193 INFO L226 Difference]: Without dead ends: 50 [2021-01-07 05:47:51,195 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 [2021-01-07 05:47:51,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-01-07 05:47:51,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-01-07 05:47:51,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2021-01-07 05:47:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2021-01-07 05:47:51,238 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 3 [2021-01-07 05:47:51,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:47:51,238 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2021-01-07 05:47:51,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:47:51,239 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2021-01-07 05:47:51,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-01-07 05:47:51,239 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:47:51,239 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-01-07 05:47:51,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 05:47:51,240 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:47:51,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:47:51,241 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-01-07 05:47:51,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:47:51,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254898284] [2021-01-07 05:47:51,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:47:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:47:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:47:51,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254898284] [2021-01-07 05:47:51,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:47:51,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:47:51,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978326988] [2021-01-07 05:47:51,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:47:51,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:47:51,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:47:51,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:47:51,318 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 3 states. [2021-01-07 05:47:51,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:47:51,447 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2021-01-07 05:47:51,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:47:51,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2021-01-07 05:47:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:47:51,450 INFO L225 Difference]: With dead ends: 46 [2021-01-07 05:47:51,451 INFO L226 Difference]: Without dead ends: 46 [2021-01-07 05:47:51,455 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 [2021-01-07 05:47:51,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-01-07 05:47:51,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-01-07 05:47:51,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2021-01-07 05:47:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2021-01-07 05:47:51,475 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 3 [2021-01-07 05:47:51,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:47:51,476 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2021-01-07 05:47:51,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:47:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2021-01-07 05:47:51,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-01-07 05:47:51,477 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:47:51,477 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-01-07 05:47:51,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 05:47:51,478 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:47:51,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:47:51,480 INFO L82 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2021-01-07 05:47:51,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:47:51,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585122469] [2021-01-07 05:47:51,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:47:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:47:51,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:47:51,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585122469] [2021-01-07 05:47:51,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:47:51,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:47:51,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965611789] [2021-01-07 05:47:51,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:47:51,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:47:51,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:47:51,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:47:51,537 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 3 states. [2021-01-07 05:47:51,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:47:51,624 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2021-01-07 05:47:51,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:47:51,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2021-01-07 05:47:51,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:47:51,627 INFO L225 Difference]: With dead ends: 42 [2021-01-07 05:47:51,627 INFO L226 Difference]: Without dead ends: 42 [2021-01-07 05:47:51,628 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 [2021-01-07 05:47:51,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-01-07 05:47:51,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-01-07 05:47:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2021-01-07 05:47:51,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2021-01-07 05:47:51,635 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 4 [2021-01-07 05:47:51,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:47:51,635 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2021-01-07 05:47:51,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:47:51,636 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2021-01-07 05:47:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-01-07 05:47:51,636 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:47:51,636 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-01-07 05:47:51,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 05:47:51,637 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:47:51,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:47:51,638 INFO L82 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2021-01-07 05:47:51,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:47:51,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312971872] [2021-01-07 05:47:51,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:47:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:47:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:47:51,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312971872] [2021-01-07 05:47:51,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:47:51,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:47:51,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499947960] [2021-01-07 05:47:51,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:47:51,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:47:51,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:47:51,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:47:51,702 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 3 states. [2021-01-07 05:47:51,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:47:51,772 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2021-01-07 05:47:51,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:47:51,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2021-01-07 05:47:51,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:47:51,775 INFO L225 Difference]: With dead ends: 38 [2021-01-07 05:47:51,775 INFO L226 Difference]: Without dead ends: 38 [2021-01-07 05:47:51,775 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 [2021-01-07 05:47:51,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-01-07 05:47:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-01-07 05:47:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-01-07 05:47:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2021-01-07 05:47:51,781 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 4 [2021-01-07 05:47:51,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:47:51,781 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2021-01-07 05:47:51,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:47:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2021-01-07 05:47:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-01-07 05:47:51,782 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:47:51,782 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-01-07 05:47:51,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 05:47:51,783 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:47:51,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:47:51,784 INFO L82 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2021-01-07 05:47:51,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:47:51,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795081722] [2021-01-07 05:47:51,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:47:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:47:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:47:51,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795081722] [2021-01-07 05:47:51,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:47:51,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:47:51,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376628285] [2021-01-07 05:47:51,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:47:51,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:47:51,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:47:51,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:47:51,828 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2021-01-07 05:47:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:47:51,907 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2021-01-07 05:47:51,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:47:51,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2021-01-07 05:47:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:47:51,909 INFO L225 Difference]: With dead ends: 34 [2021-01-07 05:47:51,909 INFO L226 Difference]: Without dead ends: 34 [2021-01-07 05:47:51,910 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 [2021-01-07 05:47:51,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-01-07 05:47:51,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-01-07 05:47:51,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2021-01-07 05:47:51,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2021-01-07 05:47:51,915 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 5 [2021-01-07 05:47:51,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:47:51,915 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2021-01-07 05:47:51,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:47:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2021-01-07 05:47:51,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-01-07 05:47:51,916 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:47:51,916 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-01-07 05:47:51,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 05:47:51,917 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:47:51,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:47:51,918 INFO L82 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2021-01-07 05:47:51,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:47:51,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409086165] [2021-01-07 05:47:51,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:47:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:47:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:47:51,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409086165] [2021-01-07 05:47:51,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:47:51,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:47:51,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120494560] [2021-01-07 05:47:51,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:47:51,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:47:51,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:47:51,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:47:51,971 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 3 states. [2021-01-07 05:47:52,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:47:52,036 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2021-01-07 05:47:52,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:47:52,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2021-01-07 05:47:52,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:47:52,038 INFO L225 Difference]: With dead ends: 30 [2021-01-07 05:47:52,038 INFO L226 Difference]: Without dead ends: 30 [2021-01-07 05:47:52,039 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 [2021-01-07 05:47:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-01-07 05:47:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-01-07 05:47:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-01-07 05:47:52,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2021-01-07 05:47:52,043 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 5 [2021-01-07 05:47:52,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:47:52,044 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2021-01-07 05:47:52,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:47:52,044 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2021-01-07 05:47:52,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-01-07 05:47:52,044 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:47:52,045 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-01-07 05:47:52,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 05:47:52,045 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:47:52,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:47:52,046 INFO L82 PathProgramCache]: Analyzing trace with hash 889446154, now seen corresponding path program 1 times [2021-01-07 05:47:52,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:47:52,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398415584] [2021-01-07 05:47:52,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:47:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:47:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:47:52,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398415584] [2021-01-07 05:47:52,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:47:52,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:47:52,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064052072] [2021-01-07 05:47:52,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:47:52,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:47:52,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:47:52,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:47:52,099 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 3 states. [2021-01-07 05:47:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:47:52,160 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2021-01-07 05:47:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:47:52,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2021-01-07 05:47:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:47:52,162 INFO L225 Difference]: With dead ends: 27 [2021-01-07 05:47:52,162 INFO L226 Difference]: Without dead ends: 27 [2021-01-07 05:47:52,163 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 [2021-01-07 05:47:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-01-07 05:47:52,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-01-07 05:47:52,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2021-01-07 05:47:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2021-01-07 05:47:52,166 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2021-01-07 05:47:52,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:47:52,167 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2021-01-07 05:47:52,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:47:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2021-01-07 05:47:52,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-01-07 05:47:52,167 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:47:52,168 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-01-07 05:47:52,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 05:47:52,168 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:47:52,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:47:52,169 INFO L82 PathProgramCache]: Analyzing trace with hash 889446155, now seen corresponding path program 1 times [2021-01-07 05:47:52,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:47:52,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477319184] [2021-01-07 05:47:52,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:47:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:47:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:47:52,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477319184] [2021-01-07 05:47:52,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:47:52,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:47:52,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778396144] [2021-01-07 05:47:52,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:47:52,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:47:52,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:47:52,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:47:52,212 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 3 states. [2021-01-07 05:47:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:47:52,257 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2021-01-07 05:47:52,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:47:52,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2021-01-07 05:47:52,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:47:52,259 INFO L225 Difference]: With dead ends: 24 [2021-01-07 05:47:52,259 INFO L226 Difference]: Without dead ends: 24 [2021-01-07 05:47:52,259 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 [2021-01-07 05:47:52,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-01-07 05:47:52,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-01-07 05:47:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2021-01-07 05:47:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-01-07 05:47:52,263 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 6 [2021-01-07 05:47:52,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:47:52,263 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-01-07 05:47:52,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:47:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-01-07 05:47:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 05:47:52,264 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:47:52,264 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:47:52,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 05:47:52,265 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:47:52,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:47:52,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1115961648, now seen corresponding path program 1 times [2021-01-07 05:47:52,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:47:52,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607328812] [2021-01-07 05:47:52,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:47:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:47:52,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:47:52,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607328812] [2021-01-07 05:47:52,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:47:52,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:47:52,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540501551] [2021-01-07 05:47:52,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:47:52,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:47:52,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:47:52,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:47:52,308 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 4 states. [2021-01-07 05:47:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:47:52,419 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2021-01-07 05:47:52,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:47:52,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2021-01-07 05:47:52,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:47:52,420 INFO L225 Difference]: With dead ends: 39 [2021-01-07 05:47:52,421 INFO L226 Difference]: Without dead ends: 39 [2021-01-07 05:47:52,421 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 [2021-01-07 05:47:52,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-01-07 05:47:52,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2021-01-07 05:47:52,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-01-07 05:47:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2021-01-07 05:47:52,425 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 10 [2021-01-07 05:47:52,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:47:52,426 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2021-01-07 05:47:52,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:47:52,426 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2021-01-07 05:47:52,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-07 05:47:52,427 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:47:52,427 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:47:52,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 05:47:52,428 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:47:52,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:47:52,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1456723757, now seen corresponding path program 1 times [2021-01-07 05:47:52,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:47:52,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816457944] [2021-01-07 05:47:52,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:47:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:47:52,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:47:52,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816457944] [2021-01-07 05:47:52,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741391124] [2021-01-07 05:47:52,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-07 05:47:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:47:52,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2021-01-07 05:47:52,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:47:52,769 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 18 treesize of output 16 [2021-01-07 05:47:52,779 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:47:52,791 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:47:52,796 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:47:52,796 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:4 [2021-01-07 05:47:52,819 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 [2021-01-07 05:47:52,820 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:47:52,829 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:47:52,831 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:47:52,831 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2021-01-07 05:47:52,870 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 [2021-01-07 05:47:52,872 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:47:52,884 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:47:52,888 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. [2021-01-07 05:47:52,889 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2021-01-07 05:47:52,956 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 [2021-01-07 05:47:52,960 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:47:52,971 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:47:52,974 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:47:52,974 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2021-01-07 05:47:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:47:52,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:47:52,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-01-07 05:47:52,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854377400] [2021-01-07 05:47:52,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:47:52,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:47:52,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:47:52,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:47:52,983 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 8 states. [2021-01-07 05:47:53,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:47:53,281 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-01-07 05:47:53,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:47:53,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2021-01-07 05:47:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:47:53,283 INFO L225 Difference]: With dead ends: 32 [2021-01-07 05:47:53,283 INFO L226 Difference]: Without dead ends: 32 [2021-01-07 05:47:53,284 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:47:53,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-01-07 05:47:53,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2021-01-07 05:47:53,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-01-07 05:47:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2021-01-07 05:47:53,288 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 15 [2021-01-07 05:47:53,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:47:53,288 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2021-01-07 05:47:53,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:47:53,288 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2021-01-07 05:47:53,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-07 05:47:53,289 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:47:53,289 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:47:53,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 05:47:53,504 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:47:53,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:47:53,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1715432197, now seen corresponding path program 1 times [2021-01-07 05:47:53,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:47:53,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512805427] [2021-01-07 05:47:53,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:47:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:47:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:47:53,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512805427] [2021-01-07 05:47:53,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351681163] [2021-01-07 05:47:53,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-07 05:47:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:47:54,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 23 conjunts are in the unsatisfiable core [2021-01-07 05:47:54,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:47:54,089 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 18 treesize of output 16 [2021-01-07 05:47:54,093 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:47:54,111 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:47:54,117 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:47:54,117 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:11 [2021-01-07 05:47:54,172 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 [2021-01-07 05:47:54,174 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:47:54,184 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:47:54,184 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:47:54,185 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2021-01-07 05:47:54,304 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:47:54,304 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 2 case distinctions, treesize of input 27 treesize of output 46 [2021-01-07 05:47:54,308 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:47:54,312 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:47:54,322 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:47:54,325 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. [2021-01-07 05:47:54,325 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2021-01-07 05:47:54,410 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:47:54,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 52 [2021-01-07 05:47:54,414 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:47:54,459 INFO L625 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2021-01-07 05:47:54,463 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:47:54,466 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:47:54,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:47:54,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:47:54,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:47:54,490 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-01-07 05:47:54,490 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:41 [2021-01-07 05:47:54,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:47:54,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:47:54,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:47:54,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:47:54,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:47:56,176 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:47:56,179 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:47:56,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:47:56,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:47:56,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:47:56,187 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:47:56,191 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:47:56,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, 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 [2021-01-07 05:47:56,215 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:47:56,226 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:47:56,227 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2021-01-07 05:47:56,230 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:47:56,244 INFO L625 ElimStorePlain]: treesize reduction 22, result has 26.7 percent of original size [2021-01-07 05:47:56,246 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:47:56,247 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:64, output treesize:3 [2021-01-07 05:47:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:47:56,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:47:56,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-01-07 05:47:56,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474450381] [2021-01-07 05:47:56,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-07 05:47:56,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:47:56,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-07 05:47:56,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=173, Unknown=3, NotChecked=0, Total=240 [2021-01-07 05:47:56,254 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 16 states. [2021-01-07 05:48:02,387 WARN L197 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-01-07 05:48:03,045 WARN L197 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2021-01-07 05:48:06,976 WARN L197 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-01-07 05:48:08,198 WARN L197 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2021-01-07 05:48:08,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:48:08,252 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2021-01-07 05:48:08,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-07 05:48:08,253 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2021-01-07 05:48:08,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:48:08,257 INFO L225 Difference]: With dead ends: 37 [2021-01-07 05:48:08,258 INFO L226 Difference]: Without dead ends: 37 [2021-01-07 05:48:08,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=192, Invalid=452, Unknown=6, NotChecked=0, Total=650 [2021-01-07 05:48:08,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-01-07 05:48:08,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2021-01-07 05:48:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2021-01-07 05:48:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2021-01-07 05:48:08,270 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 18 [2021-01-07 05:48:08,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:48:08,270 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2021-01-07 05:48:08,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-07 05:48:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2021-01-07 05:48:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-07 05:48:08,273 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:48:08,273 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] [2021-01-07 05:48:08,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:48:08,487 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:48:08,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:48:08,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1201930977, now seen corresponding path program 1 times [2021-01-07 05:48:08,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:48:08,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489343932] [2021-01-07 05:48:08,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:48:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:48:08,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:48:08,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489343932] [2021-01-07 05:48:08,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355666959] [2021-01-07 05:48:08,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-07 05:48:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:48:08,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 31 conjunts are in the unsatisfiable core [2021-01-07 05:48:08,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:48:08,997 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 18 treesize of output 16 [2021-01-07 05:48:09,004 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:09,017 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:09,021 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:09,021 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:14 [2021-01-07 05:48:09,063 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 [2021-01-07 05:48:09,065 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:09,076 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:09,077 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:09,077 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-01-07 05:48:09,205 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:09,206 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 2 case distinctions, treesize of input 27 treesize of output 46 [2021-01-07 05:48:09,210 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:09,212 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:09,223 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:09,226 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. [2021-01-07 05:48:09,226 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2021-01-07 05:48:09,404 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:09,404 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 80 [2021-01-07 05:48:09,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:09,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:09,412 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:09,441 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:09,446 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. [2021-01-07 05:48:09,447 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:41 [2021-01-07 05:48:11,613 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:11,614 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 86 [2021-01-07 05:48:11,618 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:11,688 INFO L625 ElimStorePlain]: treesize reduction 32, result has 66.7 percent of original size [2021-01-07 05:48:11,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:11,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:11,699 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:48:11,701 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:11,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:48:11,711 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:48:11,713 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:48:11,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:11,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:11,730 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,736 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:48:11,746 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. [2021-01-07 05:48:11,746 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:64 [2021-01-07 05:48:11,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:11,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:11,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:48:11,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:11,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,758 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:48:11,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:48:11,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:48:11,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:11,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:11,773 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:48:11,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:11,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:11,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:48:11,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:11,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,849 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,853 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,853 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:11,854 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:48:11,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:11,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:48:11,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:48:11,861 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:48:11,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:48:11,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:48:11,868 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:48:11,876 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:11,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:11,879 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,881 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:11,883 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:11,884 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:48:11,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:48:11,927 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:11,927 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 40 [2021-01-07 05:48:11,930 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:11,938 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 29 treesize of output 13 [2021-01-07 05:48:11,940 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:11,944 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 29 treesize of output 13 [2021-01-07 05:48:11,946 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:11,989 INFO L625 ElimStorePlain]: treesize reduction 38, result has 46.5 percent of original size [2021-01-07 05:48:11,994 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:11,996 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:135, output treesize:3 [2021-01-07 05:48:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:48:12,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:48:12,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2021-01-07 05:48:12,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276211349] [2021-01-07 05:48:12,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-07 05:48:12,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:48:12,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-07 05:48:12,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-01-07 05:48:12,022 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 20 states. [2021-01-07 05:48:35,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:48:35,119 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2021-01-07 05:48:35,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-01-07 05:48:35,119 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2021-01-07 05:48:35,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:48:35,120 INFO L225 Difference]: With dead ends: 57 [2021-01-07 05:48:35,121 INFO L226 Difference]: Without dead ends: 57 [2021-01-07 05:48:35,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=470, Invalid=1421, Unknown=1, NotChecked=0, Total=1892 [2021-01-07 05:48:35,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-01-07 05:48:35,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2021-01-07 05:48:35,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2021-01-07 05:48:35,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2021-01-07 05:48:35,126 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 21 [2021-01-07 05:48:35,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:48:35,127 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2021-01-07 05:48:35,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-07 05:48:35,127 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2021-01-07 05:48:35,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:48:35,128 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:48:35,128 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] [2021-01-07 05:48:35,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-07 05:48:35,329 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:48:35,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:48:35,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1063171374, now seen corresponding path program 1 times [2021-01-07 05:48:35,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:48:35,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212897575] [2021-01-07 05:48:35,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:48:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:48:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:48:35,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212897575] [2021-01-07 05:48:35,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567145064] [2021-01-07 05:48:35,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-07 05:48:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:48:35,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 23 conjunts are in the unsatisfiable core [2021-01-07 05:48:35,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:48:35,803 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 [2021-01-07 05:48:35,803 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:35,813 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:35,814 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:35,814 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-01-07 05:48:35,856 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:35,857 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 34 [2021-01-07 05:48:35,858 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:35,884 INFO L625 ElimStorePlain]: treesize reduction 16, result has 60.0 percent of original size [2021-01-07 05:48:35,885 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. [2021-01-07 05:48:35,885 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2021-01-07 05:48:35,943 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:35,943 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 34 [2021-01-07 05:48:35,945 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:35,967 INFO L625 ElimStorePlain]: treesize reduction 16, result has 56.8 percent of original size [2021-01-07 05:48:35,968 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. [2021-01-07 05:48:35,968 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2021-01-07 05:48:36,025 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:36,026 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 34 [2021-01-07 05:48:36,029 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:36,050 INFO L625 ElimStorePlain]: treesize reduction 16, result has 52.9 percent of original size [2021-01-07 05:48:36,051 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. [2021-01-07 05:48:36,052 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2021-01-07 05:48:36,093 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 [2021-01-07 05:48:36,094 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:36,096 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:36,096 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:36,097 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-01-07 05:48:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:48:36,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:48:36,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2021-01-07 05:48:36,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781042103] [2021-01-07 05:48:36,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:48:36,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:48:36,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:48:36,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:48:36,120 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 8 states. [2021-01-07 05:48:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:48:36,217 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2021-01-07 05:48:36,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:48:36,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2021-01-07 05:48:36,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:48:36,219 INFO L225 Difference]: With dead ends: 48 [2021-01-07 05:48:36,219 INFO L226 Difference]: Without dead ends: 48 [2021-01-07 05:48:36,219 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:48:36,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-01-07 05:48:36,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2021-01-07 05:48:36,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2021-01-07 05:48:36,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2021-01-07 05:48:36,223 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 22 [2021-01-07 05:48:36,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:48:36,224 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2021-01-07 05:48:36,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:48:36,224 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2021-01-07 05:48:36,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:48:36,225 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:48:36,225 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:48:36,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:48:36,440 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:48:36,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:48:36,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1790452235, now seen corresponding path program 1 times [2021-01-07 05:48:36,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:48:36,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525783652] [2021-01-07 05:48:36,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:48:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:48:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:48:36,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525783652] [2021-01-07 05:48:36,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438353901] [2021-01-07 05:48:36,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-07 05:48:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:48:36,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 28 conjunts are in the unsatisfiable core [2021-01-07 05:48:36,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:48:36,812 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 [2021-01-07 05:48:36,813 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:36,823 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:36,824 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:36,824 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-01-07 05:48:36,865 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:36,866 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 34 [2021-01-07 05:48:36,867 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:36,895 INFO L625 ElimStorePlain]: treesize reduction 16, result has 62.8 percent of original size [2021-01-07 05:48:36,896 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:36,896 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2021-01-07 05:48:36,962 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:36,963 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 68 [2021-01-07 05:48:36,965 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:37,018 INFO L625 ElimStorePlain]: treesize reduction 24, result has 63.6 percent of original size [2021-01-07 05:48:37,019 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:37,020 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:42 [2021-01-07 05:48:37,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:37,336 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2021-01-07 05:48:37,336 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:37,340 INFO L443 ElimStorePlain]: Different costs {3=[v_prenex_2], 5=[|v_#memory_int_43|]} [2021-01-07 05:48:37,362 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:37,362 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2021-01-07 05:48:37,367 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:37,395 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:37,436 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:37,436 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2021-01-07 05:48:37,439 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:37,463 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:37,465 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 2 xjuncts. [2021-01-07 05:48:37,465 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:51 [2021-01-07 05:48:37,568 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:37,569 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 2 case distinctions, treesize of input 26 treesize of output 60 [2021-01-07 05:48:37,586 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:37,621 INFO L625 ElimStorePlain]: treesize reduction 32, result has 47.5 percent of original size [2021-01-07 05:48:37,623 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. [2021-01-07 05:48:37,624 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:29 [2021-01-07 05:48:37,680 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 [2021-01-07 05:48:37,682 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:37,686 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:37,687 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:37,688 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2021-01-07 05:48:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:48:37,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:48:37,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2021-01-07 05:48:37,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125706305] [2021-01-07 05:48:37,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-07 05:48:37,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:48:37,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-07 05:48:37,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:48:37,698 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 17 states. [2021-01-07 05:48:38,204 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2021-01-07 05:48:38,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:48:38,746 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2021-01-07 05:48:38,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:48:38,746 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2021-01-07 05:48:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:48:38,747 INFO L225 Difference]: With dead ends: 80 [2021-01-07 05:48:38,747 INFO L226 Difference]: Without dead ends: 80 [2021-01-07 05:48:38,748 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2021-01-07 05:48:38,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-01-07 05:48:38,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 51. [2021-01-07 05:48:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2021-01-07 05:48:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2021-01-07 05:48:38,752 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 27 [2021-01-07 05:48:38,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:48:38,752 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2021-01-07 05:48:38,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-07 05:48:38,752 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2021-01-07 05:48:38,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-07 05:48:38,753 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:48:38,754 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:48:38,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 05:48:38,967 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:48:38,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:48:38,968 INFO L82 PathProgramCache]: Analyzing trace with hash -671935741, now seen corresponding path program 1 times [2021-01-07 05:48:38,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:48:38,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786190248] [2021-01-07 05:48:38,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:48:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:48:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:48:39,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786190248] [2021-01-07 05:48:39,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100193723] [2021-01-07 05:48:39,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-07 05:48:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:48:39,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 26 conjunts are in the unsatisfiable core [2021-01-07 05:48:39,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:48:39,177 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 [2021-01-07 05:48:39,178 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:39,186 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:39,187 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:39,187 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-01-07 05:48:39,326 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:39,326 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 46 [2021-01-07 05:48:39,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:39,331 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:39,342 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:39,343 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:39,343 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:28 [2021-01-07 05:48:39,401 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:39,402 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 2 case distinctions, treesize of input 26 treesize of output 60 [2021-01-07 05:48:39,406 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:39,449 INFO L625 ElimStorePlain]: treesize reduction 24, result has 64.2 percent of original size [2021-01-07 05:48:39,450 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:39,450 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:43 [2021-01-07 05:48:39,501 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:39,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:48:39,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:39,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:48:39,505 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:48:39,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:39,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:48:39,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:48:39,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:39,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:39,512 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:48:39,559 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:39,559 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 63 [2021-01-07 05:48:39,562 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:39,573 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 0 case distinctions, treesize of input 26 treesize of output 21 [2021-01-07 05:48:39,575 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:39,583 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 0 case distinctions, treesize of input 26 treesize of output 21 [2021-01-07 05:48:39,585 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:39,677 INFO L625 ElimStorePlain]: treesize reduction 12, result has 87.2 percent of original size [2021-01-07 05:48:39,682 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2021-01-07 05:48:39,683 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:119, output treesize:82 [2021-01-07 05:48:39,871 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 6, 1] term [2021-01-07 05:48:39,871 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:48:39,970 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:39,971 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 52 [2021-01-07 05:48:39,973 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:39,988 INFO L625 ElimStorePlain]: treesize reduction 7, result has 75.9 percent of original size [2021-01-07 05:48:39,990 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. [2021-01-07 05:48:39,991 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2021-01-07 05:48:40,053 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 [2021-01-07 05:48:40,055 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:40,059 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:40,060 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:40,060 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2021-01-07 05:48:40,089 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:48:40,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:48:40,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 19 [2021-01-07 05:48:40,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899268779] [2021-01-07 05:48:40,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-07 05:48:40,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:48:40,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-07 05:48:40,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:48:40,092 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 19 states. [2021-01-07 05:48:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:48:41,297 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2021-01-07 05:48:41,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-07 05:48:41,298 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2021-01-07 05:48:41,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:48:41,299 INFO L225 Difference]: With dead ends: 61 [2021-01-07 05:48:41,299 INFO L226 Difference]: Without dead ends: 61 [2021-01-07 05:48:41,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2021-01-07 05:48:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-01-07 05:48:41,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2021-01-07 05:48:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2021-01-07 05:48:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2021-01-07 05:48:41,306 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 33 [2021-01-07 05:48:41,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:48:41,307 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2021-01-07 05:48:41,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-07 05:48:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2021-01-07 05:48:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-07 05:48:41,308 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:48:41,308 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:48:41,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:48:41,522 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:48:41,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:48:41,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1607104903, now seen corresponding path program 1 times [2021-01-07 05:48:41,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:48:41,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012125455] [2021-01-07 05:48:41,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:48:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:48:41,679 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-07 05:48:41,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012125455] [2021-01-07 05:48:41,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533376698] [2021-01-07 05:48:41,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-07 05:48:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:48:41,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 27 conjunts are in the unsatisfiable core [2021-01-07 05:48:41,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:48:41,817 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 [2021-01-07 05:48:41,817 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:41,826 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:41,826 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:41,827 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-01-07 05:48:41,919 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:41,920 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 46 [2021-01-07 05:48:41,921 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:41,923 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:41,936 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:41,936 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:41,937 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:28 [2021-01-07 05:48:42,009 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:42,009 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 2 case distinctions, treesize of input 26 treesize of output 60 [2021-01-07 05:48:42,012 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:42,056 INFO L625 ElimStorePlain]: treesize reduction 24, result has 64.2 percent of original size [2021-01-07 05:48:42,057 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:42,057 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:43 [2021-01-07 05:48:42,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:48:42,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:48:42,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:42,119 WARN L220 Elim1Store]: Array PQE input equivalent to false [2021-01-07 05:48:42,120 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:42,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, 1 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 [2021-01-07 05:48:42,135 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:42,184 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:42,184 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 63 [2021-01-07 05:48:42,187 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:42,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-01-07 05:48:42,199 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:42,356 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2021-01-07 05:48:42,357 INFO L625 ElimStorePlain]: treesize reduction 43, result has 59.4 percent of original size [2021-01-07 05:48:42,358 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-07 05:48:42,359 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:169, output treesize:63 [2021-01-07 05:48:42,440 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2021-01-07 05:48:42,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:48:42,447 INFO L443 ElimStorePlain]: Different costs {5=[|v_#memory_int_54|], 11=[v_prenex_5]} [2021-01-07 05:48:42,455 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 0 case distinctions, treesize of input 26 treesize of output 21 [2021-01-07 05:48:42,456 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:42,524 INFO L625 ElimStorePlain]: treesize reduction 4, result has 94.1 percent of original size [2021-01-07 05:48:42,585 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:42,586 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2021-01-07 05:48:42,589 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:42,669 INFO L625 ElimStorePlain]: treesize reduction 16, result has 79.2 percent of original size [2021-01-07 05:48:42,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:42,674 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 2 xjuncts. [2021-01-07 05:48:42,674 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:61 [2021-01-07 05:48:42,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:42,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:48:42,868 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 6, 1] term [2021-01-07 05:48:42,869 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:48:42,953 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:42,955 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 52 [2021-01-07 05:48:42,958 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:42,974 INFO L625 ElimStorePlain]: treesize reduction 7, result has 75.9 percent of original size [2021-01-07 05:48:42,975 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. [2021-01-07 05:48:42,975 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2021-01-07 05:48:43,019 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 [2021-01-07 05:48:43,021 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:43,025 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:43,026 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:43,027 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2021-01-07 05:48:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-07 05:48:43,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:48:43,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 20 [2021-01-07 05:48:43,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211337704] [2021-01-07 05:48:43,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-07 05:48:43,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:48:43,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-07 05:48:43,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-01-07 05:48:43,067 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 20 states. [2021-01-07 05:48:46,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:48:46,235 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2021-01-07 05:48:46,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 05:48:46,238 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2021-01-07 05:48:46,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:48:46,239 INFO L225 Difference]: With dead ends: 76 [2021-01-07 05:48:46,239 INFO L226 Difference]: Without dead ends: 76 [2021-01-07 05:48:46,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=202, Invalid=789, Unknown=1, NotChecked=0, Total=992 [2021-01-07 05:48:46,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-01-07 05:48:46,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2021-01-07 05:48:46,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2021-01-07 05:48:46,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2021-01-07 05:48:46,247 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 43 [2021-01-07 05:48:46,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:48:46,247 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2021-01-07 05:48:46,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-07 05:48:46,247 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2021-01-07 05:48:46,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-07 05:48:46,249 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:48:46,250 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:48:46,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-07 05:48:46,463 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:48:46,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:48:46,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1808315229, now seen corresponding path program 1 times [2021-01-07 05:48:46,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:48:46,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211056013] [2021-01-07 05:48:46,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:48:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:48:47,087 WARN L197 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2021-01-07 05:48:47,297 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2021-01-07 05:48:47,793 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 102 proven. 38 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-07 05:48:47,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211056013] [2021-01-07 05:48:47,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054305888] [2021-01-07 05:48:47,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-07 05:48:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:48:47,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 42 conjunts are in the unsatisfiable core [2021-01-07 05:48:47,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:48:48,042 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 [2021-01-07 05:48:48,043 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:48,078 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:48,079 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:48,079 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:73 [2021-01-07 05:48:48,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:48:48,174 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 15 treesize of output 7 [2021-01-07 05:48:48,176 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:48,209 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:48,210 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:48,210 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:66 [2021-01-07 05:48:48,317 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 [2021-01-07 05:48:48,317 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:48,340 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:48,341 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:48,341 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:67 [2021-01-07 05:48:48,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:48:48,426 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 15 treesize of output 7 [2021-01-07 05:48:48,430 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:48:48,446 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:48:48,450 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:48:48,450 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:54 [2021-01-07 05:48:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-01-07 05:48:48,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:48:48,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 18 [2021-01-07 05:48:48,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697919860] [2021-01-07 05:48:48,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-07 05:48:48,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:48:48,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-07 05:48:48,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:48:48,688 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 19 states. [2021-01-07 05:48:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:48:49,226 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2021-01-07 05:48:49,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:48:49,227 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2021-01-07 05:48:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:48:49,228 INFO L225 Difference]: With dead ends: 81 [2021-01-07 05:48:49,228 INFO L226 Difference]: Without dead ends: 0 [2021-01-07 05:48:49,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2021-01-07 05:48:49,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-07 05:48:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-07 05:48:49,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-07 05:48:49,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-07 05:48:49,229 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2021-01-07 05:48:49,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:48:49,230 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-07 05:48:49,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-07 05:48:49,230 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-07 05:48:49,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-07 05:48:49,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-07 05:48:49,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 05:48:49 BoogieIcfgContainer [2021-01-07 05:48:49,441 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-07 05:48:49,442 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-07 05:48:49,442 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-07 05:48:49,442 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-07 05:48:49,443 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:47:50" (3/4) ... [2021-01-07 05:48:49,448 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-07 05:48:49,467 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-01-07 05:48:49,467 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-01-07 05:48:49,467 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-01-07 05:48:49,539 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/termination-crafted/4BitCounterPointer.c-witness.graphml [2021-01-07 05:48:49,540 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-07 05:48:49,541 INFO L168 Benchmark]: Toolchain (without parser) took 60050.63 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 127.0 MB in the beginning and 106.4 MB in the end (delta: 20.6 MB). Peak memory consumption was 51.5 MB. Max. memory is 8.0 GB. [2021-01-07 05:48:49,541 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 151.0 MB. Free memory is still 125.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-07 05:48:49,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.52 ms. Allocated memory is still 151.0 MB. Free memory was 126.7 MB in the beginning and 117.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-01-07 05:48:49,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.26 ms. Allocated memory is still 151.0 MB. Free memory was 117.6 MB in the beginning and 116.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-07 05:48:49,542 INFO L168 Benchmark]: Boogie Preprocessor took 58.02 ms. Allocated memory is still 151.0 MB. Free memory was 116.3 MB in the beginning and 115.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-07 05:48:49,542 INFO L168 Benchmark]: RCFGBuilder took 826.23 ms. Allocated memory is still 151.0 MB. Free memory was 115.1 MB in the beginning and 128.3 MB in the end (delta: -13.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2021-01-07 05:48:49,543 INFO L168 Benchmark]: TraceAbstraction took 58761.32 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 128.3 MB in the beginning and 109.0 MB in the end (delta: 19.3 MB). Peak memory consumption was 50.7 MB. Max. memory is 8.0 GB. [2021-01-07 05:48:49,544 INFO L168 Benchmark]: Witness Printer took 97.84 ms. Allocated memory is still 181.4 MB. Free memory was 109.0 MB in the beginning and 106.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-07 05:48:49,547 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 151.0 MB. Free memory is still 125.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 239.52 ms. Allocated memory is still 151.0 MB. Free memory was 126.7 MB in the beginning and 117.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 56.26 ms. Allocated memory is still 151.0 MB. Free memory was 117.6 MB in the beginning and 116.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 58.02 ms. Allocated memory is still 151.0 MB. Free memory was 116.3 MB in the beginning and 115.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 826.23 ms. Allocated memory is still 151.0 MB. Free memory was 115.1 MB in the beginning and 128.3 MB in the end (delta: -13.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 58761.32 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 128.3 MB in the beginning and 109.0 MB in the end (delta: 19.3 MB). Peak memory consumption was 50.7 MB. Max. memory is 8.0 GB. * Witness Printer took 97.84 ms. Allocated memory is still 181.4 MB. Free memory was 109.0 MB in the beginning and 106.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 31 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 58.6s, OverallIterations: 17, TraceHistogramMax: 9, AutomataDifference: 42.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 253 SDtfs, 841 SDslu, 585 SDs, 0 SdLazy, 1973 SolverSat, 403 SolverUnsat, 21 SolverUnknown, 0 SolverNotchecked, 30.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 210 SyntacticMatches, 11 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 19.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 82 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 542 NumberOfCodeBlocks, 542 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 517 ConstructedInterpolants, 29 QuantifiedInterpolants, 732241 SizeOfPredicates, 99 NumberOfNonLiveVariables, 1348 ConjunctsInSsa, 211 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 236/450 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...