/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/list-simple/dll2c_remove_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 05:33:01,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 05:33:01,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 05:33:01,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 05:33:01,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 05:33:01,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 05:33:01,318 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 05:33:01,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 05:33:01,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 05:33:01,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 05:33:01,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 05:33:01,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 05:33:01,343 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 05:33:01,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 05:33:01,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 05:33:01,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 05:33:01,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 05:33:01,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 05:33:01,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 05:33:01,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 05:33:01,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 05:33:01,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 05:33:01,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 05:33:01,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 05:33:01,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 05:33:01,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 05:33:01,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 05:33:01,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 05:33:01,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 05:33:01,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 05:33:01,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 05:33:01,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 05:33:01,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 05:33:01,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 05:33:01,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 05:33:01,390 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 05:33:01,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 05:33:01,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 05:33:01,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 05:33:01,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 05:33:01,394 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 05:33:01,395 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:33:01,423 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 05:33:01,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 05:33:01,425 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 05:33:01,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 05:33:01,426 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 05:33:01,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 05:33:01,426 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-01-07 05:33:01,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 05:33:01,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 05:33:01,427 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-01-07 05:33:01,427 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-01-07 05:33:01,427 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-01-07 05:33:01,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 05:33:01,428 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-01-07 05:33:01,428 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 05:33:01,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 05:33:01,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 05:33:01,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 05:33:01,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:33:01,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 05:33:01,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 05:33:01,429 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 05:33:01,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 05:33:01,430 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 05:33:01,430 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:33:01,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 05:33:01,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 05:33:01,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 05:33:01,902 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 05:33:01,903 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 05:33:01,904 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_remove_all.i [2021-01-07 05:33:02,009 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0e1b4b11e/a455aa1eaf2d4e3f99f271d0667c36cd/FLAG0fcc48efd [2021-01-07 05:33:02,707 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 05:33:02,708 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all.i [2021-01-07 05:33:02,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0e1b4b11e/a455aa1eaf2d4e3f99f271d0667c36cd/FLAG0fcc48efd [2021-01-07 05:33:02,990 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0e1b4b11e/a455aa1eaf2d4e3f99f271d0667c36cd [2021-01-07 05:33:02,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 05:33:02,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 05:33:02,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 05:33:02,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 05:33:03,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 05:33:03,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:33:02" (1/1) ... [2021-01-07 05:33:03,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600b1d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:03, skipping insertion in model container [2021-01-07 05:33:03,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:33:02" (1/1) ... [2021-01-07 05:33:03,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 05:33:03,060 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~last~0,],base],StructAccessExpression[IdentifierExpression[~last~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~head,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~temp~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~last~1,],base],StructAccessExpression[IdentifierExpression[~last~1,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~head,] [2021-01-07 05:33:03,445 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all.i[24169,24182] [2021-01-07 05:33:03,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:33:03,469 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~last~0,],base],StructAccessExpression[IdentifierExpression[~last~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~head,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~temp~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~last~1,],base],StructAccessExpression[IdentifierExpression[~last~1,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~head,] [2021-01-07 05:33:03,525 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all.i[24169,24182] [2021-01-07 05:33:03,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:33:03,606 INFO L208 MainTranslator]: Completed translation [2021-01-07 05:33:03,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:03 WrapperNode [2021-01-07 05:33:03,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 05:33:03,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 05:33:03,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 05:33:03,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 05:33:03,619 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:33:03" (1/1) ... [2021-01-07 05:33:03,638 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:33:03" (1/1) ... [2021-01-07 05:33:03,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 05:33:03,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 05:33:03,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 05:33:03,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 05:33:03,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:03" (1/1) ... [2021-01-07 05:33:03,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:03" (1/1) ... [2021-01-07 05:33:03,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:03" (1/1) ... [2021-01-07 05:33:03,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:03" (1/1) ... [2021-01-07 05:33:03,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:03" (1/1) ... [2021-01-07 05:33:03,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:03" (1/1) ... [2021-01-07 05:33:03,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:03" (1/1) ... [2021-01-07 05:33:03,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 05:33:03,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 05:33:03,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 05:33:03,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 05:33:03,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:03" (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:33:03,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 05:33:03,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 05:33:03,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 05:33:03,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 05:33:03,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 05:33:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 05:33:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 05:33:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 05:33:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 05:33:03,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 05:33:04,920 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 05:33:04,920 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-01-07 05:33:04,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:33:04 BoogieIcfgContainer [2021-01-07 05:33:04,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 05:33:04,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 05:33:04,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 05:33:04,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 05:33:04,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 05:33:02" (1/3) ... [2021-01-07 05:33:04,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654c3512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:33:04, skipping insertion in model container [2021-01-07 05:33:04,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:03" (2/3) ... [2021-01-07 05:33:04,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654c3512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:33:04, skipping insertion in model container [2021-01-07 05:33:04,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:33:04" (3/3) ... [2021-01-07 05:33:04,934 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all.i [2021-01-07 05:33:04,941 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 05:33:04,948 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 52 error locations. [2021-01-07 05:33:04,969 INFO L253 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2021-01-07 05:33:04,993 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 05:33:04,993 INFO L378 AbstractCegarLoop]: Hoare is false [2021-01-07 05:33:04,993 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 05:33:04,994 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 05:33:04,994 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 05:33:04,994 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 05:33:04,994 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 05:33:04,994 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 05:33:05,017 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2021-01-07 05:33:05,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-01-07 05:33:05,025 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:05,026 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-01-07 05:33:05,027 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:05,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:05,034 INFO L82 PathProgramCache]: Analyzing trace with hash 925702, now seen corresponding path program 1 times [2021-01-07 05:33:05,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:05,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950615438] [2021-01-07 05:33:05,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:05,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950615438] [2021-01-07 05:33:05,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:05,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:33:05,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263973218] [2021-01-07 05:33:05,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:33:05,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:05,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:33:05,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:33:05,281 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 3 states. [2021-01-07 05:33:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:05,529 INFO L93 Difference]: Finished difference Result 148 states and 155 transitions. [2021-01-07 05:33:05,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:33:05,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2021-01-07 05:33:05,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:05,555 INFO L225 Difference]: With dead ends: 148 [2021-01-07 05:33:05,558 INFO L226 Difference]: Without dead ends: 144 [2021-01-07 05:33:05,565 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:33:05,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-01-07 05:33:05,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 95. [2021-01-07 05:33:05,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2021-01-07 05:33:05,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2021-01-07 05:33:05,627 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 4 [2021-01-07 05:33:05,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:05,627 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2021-01-07 05:33:05,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:33:05,628 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2021-01-07 05:33:05,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-01-07 05:33:05,628 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:05,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-01-07 05:33:05,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 05:33:05,629 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:05,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:05,631 INFO L82 PathProgramCache]: Analyzing trace with hash 925703, now seen corresponding path program 1 times [2021-01-07 05:33:05,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:05,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076844430] [2021-01-07 05:33:05,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:05,696 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:33:05,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076844430] [2021-01-07 05:33:05,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:05,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:33:05,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189992065] [2021-01-07 05:33:05,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:33:05,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:05,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:33:05,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:33:05,701 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 3 states. [2021-01-07 05:33:05,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:05,844 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2021-01-07 05:33:05,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:33:05,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2021-01-07 05:33:05,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:05,847 INFO L225 Difference]: With dead ends: 89 [2021-01-07 05:33:05,847 INFO L226 Difference]: Without dead ends: 89 [2021-01-07 05:33:05,848 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:33:05,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-01-07 05:33:05,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-01-07 05:33:05,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2021-01-07 05:33:05,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2021-01-07 05:33:05,858 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 4 [2021-01-07 05:33:05,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:05,859 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2021-01-07 05:33:05,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:33:05,859 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2021-01-07 05:33:05,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 05:33:05,860 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:05,860 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:05,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 05:33:05,861 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:05,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:05,862 INFO L82 PathProgramCache]: Analyzing trace with hash 613332465, now seen corresponding path program 1 times [2021-01-07 05:33:05,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:05,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613898948] [2021-01-07 05:33:05,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:05,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613898948] [2021-01-07 05:33:05,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:05,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:33:05,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092614524] [2021-01-07 05:33:05,992 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:33:05,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:05,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:33:05,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:33:06,000 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 3 states. [2021-01-07 05:33:06,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:06,030 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2021-01-07 05:33:06,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:33:06,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2021-01-07 05:33:06,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:06,035 INFO L225 Difference]: With dead ends: 104 [2021-01-07 05:33:06,035 INFO L226 Difference]: Without dead ends: 104 [2021-01-07 05:33:06,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:33:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-01-07 05:33:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 90. [2021-01-07 05:33:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2021-01-07 05:33:06,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2021-01-07 05:33:06,056 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 10 [2021-01-07 05:33:06,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:06,057 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2021-01-07 05:33:06,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:33:06,057 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2021-01-07 05:33:06,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:33:06,058 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:06,058 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:06,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 05:33:06,058 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:06,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:06,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1103137848, now seen corresponding path program 1 times [2021-01-07 05:33:06,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:06,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374748254] [2021-01-07 05:33:06,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:06,141 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:33:06,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374748254] [2021-01-07 05:33:06,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:06,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:33:06,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212442187] [2021-01-07 05:33:06,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:33:06,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:06,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:33:06,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:33:06,145 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand 5 states. [2021-01-07 05:33:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:06,501 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2021-01-07 05:33:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:33:06,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2021-01-07 05:33:06,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:06,503 INFO L225 Difference]: With dead ends: 144 [2021-01-07 05:33:06,503 INFO L226 Difference]: Without dead ends: 144 [2021-01-07 05:33:06,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:33:06,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-01-07 05:33:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 89. [2021-01-07 05:33:06,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2021-01-07 05:33:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2021-01-07 05:33:06,513 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 16 [2021-01-07 05:33:06,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:06,514 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2021-01-07 05:33:06,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:33:06,514 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2021-01-07 05:33:06,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:33:06,515 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:06,515 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:06,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 05:33:06,516 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:06,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:06,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1103137849, now seen corresponding path program 1 times [2021-01-07 05:33:06,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:06,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841767170] [2021-01-07 05:33:06,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:06,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841767170] [2021-01-07 05:33:06,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:06,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:33:06,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105161000] [2021-01-07 05:33:06,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:33:06,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:06,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:33:06,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:33:06,696 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 5 states. [2021-01-07 05:33:06,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:06,877 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2021-01-07 05:33:06,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:33:06,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2021-01-07 05:33:06,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:06,879 INFO L225 Difference]: With dead ends: 94 [2021-01-07 05:33:06,880 INFO L226 Difference]: Without dead ends: 94 [2021-01-07 05:33:06,880 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:33:06,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-01-07 05:33:06,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2021-01-07 05:33:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2021-01-07 05:33:06,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2021-01-07 05:33:06,888 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 16 [2021-01-07 05:33:06,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:06,888 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2021-01-07 05:33:06,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:33:06,888 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2021-01-07 05:33:06,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-07 05:33:06,889 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:06,889 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:06,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 05:33:06,890 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:06,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:06,891 INFO L82 PathProgramCache]: Analyzing trace with hash -741449383, now seen corresponding path program 1 times [2021-01-07 05:33:06,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:06,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497347409] [2021-01-07 05:33:06,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:07,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:07,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497347409] [2021-01-07 05:33:07,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:07,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:33:07,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298628548] [2021-01-07 05:33:07,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:33:07,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:07,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:33:07,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:33:07,090 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 6 states. [2021-01-07 05:33:07,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:07,416 INFO L93 Difference]: Finished difference Result 148 states and 154 transitions. [2021-01-07 05:33:07,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:33:07,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2021-01-07 05:33:07,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:07,418 INFO L225 Difference]: With dead ends: 148 [2021-01-07 05:33:07,419 INFO L226 Difference]: Without dead ends: 148 [2021-01-07 05:33:07,419 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:33:07,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-01-07 05:33:07,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 97. [2021-01-07 05:33:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2021-01-07 05:33:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2021-01-07 05:33:07,427 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 18 [2021-01-07 05:33:07,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:07,428 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2021-01-07 05:33:07,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:33:07,428 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2021-01-07 05:33:07,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-07 05:33:07,428 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:07,429 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:07,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 05:33:07,429 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:07,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:07,430 INFO L82 PathProgramCache]: Analyzing trace with hash -741449382, now seen corresponding path program 1 times [2021-01-07 05:33:07,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:07,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022512419] [2021-01-07 05:33:07,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:07,514 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:33:07,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022512419] [2021-01-07 05:33:07,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:07,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:33:07,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267587061] [2021-01-07 05:33:07,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:33:07,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:07,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:33:07,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:33:07,517 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 5 states. [2021-01-07 05:33:07,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:07,739 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2021-01-07 05:33:07,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:33:07,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2021-01-07 05:33:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:07,741 INFO L225 Difference]: With dead ends: 98 [2021-01-07 05:33:07,741 INFO L226 Difference]: Without dead ends: 98 [2021-01-07 05:33:07,742 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:33:07,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-01-07 05:33:07,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2021-01-07 05:33:07,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2021-01-07 05:33:07,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2021-01-07 05:33:07,748 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 18 [2021-01-07 05:33:07,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:07,748 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2021-01-07 05:33:07,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:33:07,749 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2021-01-07 05:33:07,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 05:33:07,749 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:07,749 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:07,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 05:33:07,750 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:07,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:07,751 INFO L82 PathProgramCache]: Analyzing trace with hash 431868768, now seen corresponding path program 1 times [2021-01-07 05:33:07,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:07,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771099417] [2021-01-07 05:33:07,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:07,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771099417] [2021-01-07 05:33:07,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:07,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 05:33:07,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095488983] [2021-01-07 05:33:07,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:33:07,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:07,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:33:07,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:33:07,824 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 6 states. [2021-01-07 05:33:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:07,947 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2021-01-07 05:33:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:33:07,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2021-01-07 05:33:07,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:07,950 INFO L225 Difference]: With dead ends: 98 [2021-01-07 05:33:07,950 INFO L226 Difference]: Without dead ends: 98 [2021-01-07 05:33:07,951 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:33:07,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-01-07 05:33:07,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2021-01-07 05:33:07,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2021-01-07 05:33:07,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2021-01-07 05:33:07,958 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 20 [2021-01-07 05:33:07,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:07,958 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2021-01-07 05:33:07,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:33:07,958 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2021-01-07 05:33:07,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-07 05:33:07,960 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:07,960 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:07,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 05:33:07,960 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:07,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:07,961 INFO L82 PathProgramCache]: Analyzing trace with hash 498265101, now seen corresponding path program 1 times [2021-01-07 05:33:07,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:07,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796948938] [2021-01-07 05:33:07,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:08,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:08,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796948938] [2021-01-07 05:33:08,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94983763] [2021-01-07 05:33:08,069 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:33:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:08,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-07 05:33:08,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:08,319 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-01-07 05:33:08,320 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2021-01-07 05:33:08,322 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:08,327 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:08,334 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:08,334 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2021-01-07 05:33:08,490 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:08,491 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2021-01-07 05:33:08,498 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:08,532 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2021-01-07 05:33:08,535 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:08,535 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2021-01-07 05:33:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:08,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:33:08,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2021-01-07 05:33:08,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379851442] [2021-01-07 05:33:08,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:33:08,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:08,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:33:08,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:33:08,571 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 8 states. [2021-01-07 05:33:08,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:08,947 INFO L93 Difference]: Finished difference Result 147 states and 152 transitions. [2021-01-07 05:33:08,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:33:08,948 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2021-01-07 05:33:08,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:08,950 INFO L225 Difference]: With dead ends: 147 [2021-01-07 05:33:08,950 INFO L226 Difference]: Without dead ends: 147 [2021-01-07 05:33:08,950 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-07 05:33:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-01-07 05:33:08,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 96. [2021-01-07 05:33:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2021-01-07 05:33:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2021-01-07 05:33:08,956 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 21 [2021-01-07 05:33:08,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:08,956 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2021-01-07 05:33:08,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:33:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2021-01-07 05:33:08,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-07 05:33:08,957 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:08,957 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:09,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-01-07 05:33:09,173 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:09,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:09,175 INFO L82 PathProgramCache]: Analyzing trace with hash 498265102, now seen corresponding path program 1 times [2021-01-07 05:33:09,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:09,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87391419] [2021-01-07 05:33:09,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:09,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:09,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87391419] [2021-01-07 05:33:09,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71165917] [2021-01-07 05:33:09,327 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:33:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:09,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 15 conjunts are in the unsatisfiable core [2021-01-07 05:33:09,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:09,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:09,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:33:09,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2021-01-07 05:33:09,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112956527] [2021-01-07 05:33:09,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:33:09,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:09,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:33:09,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:33:09,597 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand 10 states. [2021-01-07 05:33:09,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:09,954 INFO L93 Difference]: Finished difference Result 162 states and 167 transitions. [2021-01-07 05:33:09,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:33:09,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2021-01-07 05:33:09,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:09,959 INFO L225 Difference]: With dead ends: 162 [2021-01-07 05:33:09,960 INFO L226 Difference]: Without dead ends: 162 [2021-01-07 05:33:09,961 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-01-07 05:33:09,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-01-07 05:33:09,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 99. [2021-01-07 05:33:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2021-01-07 05:33:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2021-01-07 05:33:09,968 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 21 [2021-01-07 05:33:09,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:09,969 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2021-01-07 05:33:09,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:33:09,969 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2021-01-07 05:33:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:33:09,971 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:09,971 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:10,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 05:33:10,178 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:10,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:10,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1733651014, now seen corresponding path program 1 times [2021-01-07 05:33:10,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:10,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164069489] [2021-01-07 05:33:10,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:10,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164069489] [2021-01-07 05:33:10,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:10,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:33:10,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192948803] [2021-01-07 05:33:10,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:33:10,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:10,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:33:10,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:33:10,271 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 6 states. [2021-01-07 05:33:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:10,537 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2021-01-07 05:33:10,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:33:10,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2021-01-07 05:33:10,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:10,551 INFO L225 Difference]: With dead ends: 146 [2021-01-07 05:33:10,551 INFO L226 Difference]: Without dead ends: 146 [2021-01-07 05:33:10,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:33:10,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-01-07 05:33:10,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 97. [2021-01-07 05:33:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2021-01-07 05:33:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2021-01-07 05:33:10,556 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 22 [2021-01-07 05:33:10,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:10,557 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2021-01-07 05:33:10,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:33:10,557 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2021-01-07 05:33:10,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:33:10,558 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:10,558 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:10,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 05:33:10,559 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:10,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:10,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1733651013, now seen corresponding path program 1 times [2021-01-07 05:33:10,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:10,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845469092] [2021-01-07 05:33:10,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:10,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845469092] [2021-01-07 05:33:10,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:10,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:33:10,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584199014] [2021-01-07 05:33:10,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:33:10,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:10,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:33:10,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:33:10,645 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 6 states. [2021-01-07 05:33:10,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:10,902 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2021-01-07 05:33:10,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:33:10,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2021-01-07 05:33:10,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:10,904 INFO L225 Difference]: With dead ends: 95 [2021-01-07 05:33:10,904 INFO L226 Difference]: Without dead ends: 95 [2021-01-07 05:33:10,908 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:33:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-01-07 05:33:10,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-01-07 05:33:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2021-01-07 05:33:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2021-01-07 05:33:10,913 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 22 [2021-01-07 05:33:10,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:10,914 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2021-01-07 05:33:10,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:33:10,915 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2021-01-07 05:33:10,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-07 05:33:10,924 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:10,925 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:10,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 05:33:10,925 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:10,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:10,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1906895896, now seen corresponding path program 1 times [2021-01-07 05:33:10,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:10,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792586431] [2021-01-07 05:33:10,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:11,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:33:11,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792586431] [2021-01-07 05:33:11,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:11,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:33:11,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579346429] [2021-01-07 05:33:11,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:33:11,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:11,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:33:11,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:33:11,018 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 4 states. [2021-01-07 05:33:11,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:11,034 INFO L93 Difference]: Finished difference Result 145 states and 150 transitions. [2021-01-07 05:33:11,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:33:11,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2021-01-07 05:33:11,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:11,039 INFO L225 Difference]: With dead ends: 145 [2021-01-07 05:33:11,039 INFO L226 Difference]: Without dead ends: 145 [2021-01-07 05:33:11,041 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:33:11,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-01-07 05:33:11,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2021-01-07 05:33:11,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2021-01-07 05:33:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2021-01-07 05:33:11,045 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 26 [2021-01-07 05:33:11,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:11,046 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2021-01-07 05:33:11,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:33:11,047 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2021-01-07 05:33:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-07 05:33:11,052 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:11,053 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:11,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 05:33:11,053 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:11,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:11,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1906895901, now seen corresponding path program 1 times [2021-01-07 05:33:11,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:11,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395828042] [2021-01-07 05:33:11,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:33:11,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395828042] [2021-01-07 05:33:11,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:11,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:33:11,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921204275] [2021-01-07 05:33:11,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:33:11,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:11,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:33:11,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:33:11,185 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 5 states. [2021-01-07 05:33:11,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:11,360 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2021-01-07 05:33:11,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:33:11,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2021-01-07 05:33:11,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:11,362 INFO L225 Difference]: With dead ends: 129 [2021-01-07 05:33:11,362 INFO L226 Difference]: Without dead ends: 129 [2021-01-07 05:33:11,362 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:33:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-01-07 05:33:11,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 93. [2021-01-07 05:33:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2021-01-07 05:33:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2021-01-07 05:33:11,366 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 26 [2021-01-07 05:33:11,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:11,367 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2021-01-07 05:33:11,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:33:11,367 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2021-01-07 05:33:11,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-07 05:33:11,367 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:11,368 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:11,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 05:33:11,368 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:11,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:11,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1906895902, now seen corresponding path program 1 times [2021-01-07 05:33:11,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:11,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602012380] [2021-01-07 05:33:11,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:11,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:11,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602012380] [2021-01-07 05:33:11,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617129451] [2021-01-07 05:33:11,477 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:33:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:11,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-07 05:33:11,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:11,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:11,629 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-01-07 05:33:11,631 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:11,641 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:11,644 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:11,644 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:20 [2021-01-07 05:33:11,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:11,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:11,782 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:11,782 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2021-01-07 05:33:11,785 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:11,817 INFO L625 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2021-01-07 05:33:11,821 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:11,822 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2021-01-07 05:33:12,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:12,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:33:12,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-01-07 05:33:12,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078732315] [2021-01-07 05:33:12,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:33:12,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:12,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:33:12,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:33:12,096 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 8 states. [2021-01-07 05:33:12,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:12,281 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2021-01-07 05:33:12,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:33:12,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2021-01-07 05:33:12,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:12,283 INFO L225 Difference]: With dead ends: 85 [2021-01-07 05:33:12,283 INFO L226 Difference]: Without dead ends: 85 [2021-01-07 05:33:12,288 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:33:12,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-01-07 05:33:12,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-01-07 05:33:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2021-01-07 05:33:12,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2021-01-07 05:33:12,293 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 26 [2021-01-07 05:33:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:12,294 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2021-01-07 05:33:12,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:33:12,294 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2021-01-07 05:33:12,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:33:12,294 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:12,295 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:12,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-07 05:33:12,496 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:12,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:12,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1015769156, now seen corresponding path program 1 times [2021-01-07 05:33:12,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:12,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943643770] [2021-01-07 05:33:12,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:12,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:12,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943643770] [2021-01-07 05:33:12,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:12,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:33:12,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751128248] [2021-01-07 05:33:12,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:33:12,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:12,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:33:12,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:33:12,612 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 10 states. [2021-01-07 05:33:13,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:13,155 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2021-01-07 05:33:13,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-07 05:33:13,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2021-01-07 05:33:13,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:13,157 INFO L225 Difference]: With dead ends: 115 [2021-01-07 05:33:13,157 INFO L226 Difference]: Without dead ends: 115 [2021-01-07 05:33:13,158 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:33:13,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-01-07 05:33:13,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 86. [2021-01-07 05:33:13,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2021-01-07 05:33:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2021-01-07 05:33:13,161 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 27 [2021-01-07 05:33:13,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:13,161 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2021-01-07 05:33:13,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:33:13,161 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2021-01-07 05:33:13,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:33:13,162 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:13,162 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:13,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 05:33:13,162 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:13,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:13,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1015769155, now seen corresponding path program 1 times [2021-01-07 05:33:13,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:13,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634283010] [2021-01-07 05:33:13,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:13,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634283010] [2021-01-07 05:33:13,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:13,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:33:13,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343885939] [2021-01-07 05:33:13,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:33:13,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:13,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:33:13,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:33:13,330 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 10 states. [2021-01-07 05:33:13,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:13,915 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2021-01-07 05:33:13,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 05:33:13,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2021-01-07 05:33:13,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:13,917 INFO L225 Difference]: With dead ends: 106 [2021-01-07 05:33:13,917 INFO L226 Difference]: Without dead ends: 106 [2021-01-07 05:33:13,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:33:13,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-01-07 05:33:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 86. [2021-01-07 05:33:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2021-01-07 05:33:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2021-01-07 05:33:13,921 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 27 [2021-01-07 05:33:13,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:13,921 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2021-01-07 05:33:13,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:33:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2021-01-07 05:33:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-07 05:33:13,922 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:13,922 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:13,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 05:33:13,923 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:13,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:13,923 INFO L82 PathProgramCache]: Analyzing trace with hash 2090471037, now seen corresponding path program 1 times [2021-01-07 05:33:13,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:13,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211337098] [2021-01-07 05:33:13,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:13,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211337098] [2021-01-07 05:33:13,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361414365] [2021-01-07 05:33:13,989 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:33:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:14,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 05:33:14,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:14,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:33:14,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-01-07 05:33:14,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97778598] [2021-01-07 05:33:14,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:33:14,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:14,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:33:14,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:33:14,158 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 4 states. [2021-01-07 05:33:14,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:14,168 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2021-01-07 05:33:14,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:33:14,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2021-01-07 05:33:14,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:14,169 INFO L225 Difference]: With dead ends: 73 [2021-01-07 05:33:14,169 INFO L226 Difference]: Without dead ends: 73 [2021-01-07 05:33:14,169 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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:33:14,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-01-07 05:33:14,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-01-07 05:33:14,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2021-01-07 05:33:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2021-01-07 05:33:14,172 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 31 [2021-01-07 05:33:14,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:14,173 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2021-01-07 05:33:14,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:33:14,173 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2021-01-07 05:33:14,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-07 05:33:14,174 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:14,174 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:14,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-07 05:33:14,388 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:14,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:14,390 INFO L82 PathProgramCache]: Analyzing trace with hash 889920199, now seen corresponding path program 1 times [2021-01-07 05:33:14,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:14,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180229586] [2021-01-07 05:33:14,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:14,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:14,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180229586] [2021-01-07 05:33:14,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:14,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:33:14,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513427236] [2021-01-07 05:33:14,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:33:14,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:14,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:33:14,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:33:14,501 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 10 states. [2021-01-07 05:33:14,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:14,808 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2021-01-07 05:33:14,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-07 05:33:14,809 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2021-01-07 05:33:14,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:14,811 INFO L225 Difference]: With dead ends: 113 [2021-01-07 05:33:14,811 INFO L226 Difference]: Without dead ends: 113 [2021-01-07 05:33:14,812 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2021-01-07 05:33:14,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-01-07 05:33:14,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 85. [2021-01-07 05:33:14,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2021-01-07 05:33:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2021-01-07 05:33:14,815 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 32 [2021-01-07 05:33:14,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:14,815 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2021-01-07 05:33:14,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:33:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2021-01-07 05:33:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-07 05:33:14,816 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:14,816 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:14,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 05:33:14,817 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:14,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:14,817 INFO L82 PathProgramCache]: Analyzing trace with hash 889934102, now seen corresponding path program 1 times [2021-01-07 05:33:14,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:14,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694709566] [2021-01-07 05:33:14,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:14,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694709566] [2021-01-07 05:33:14,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:14,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:33:14,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159676858] [2021-01-07 05:33:14,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:33:14,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:14,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:33:14,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:33:14,903 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 10 states. [2021-01-07 05:33:15,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:15,335 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2021-01-07 05:33:15,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 05:33:15,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2021-01-07 05:33:15,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:15,336 INFO L225 Difference]: With dead ends: 111 [2021-01-07 05:33:15,337 INFO L226 Difference]: Without dead ends: 111 [2021-01-07 05:33:15,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2021-01-07 05:33:15,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-01-07 05:33:15,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2021-01-07 05:33:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2021-01-07 05:33:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2021-01-07 05:33:15,340 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 32 [2021-01-07 05:33:15,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:15,341 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2021-01-07 05:33:15,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:33:15,341 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2021-01-07 05:33:15,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-07 05:33:15,341 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:15,341 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:15,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 05:33:15,342 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:15,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:15,342 INFO L82 PathProgramCache]: Analyzing trace with hash 889934103, now seen corresponding path program 1 times [2021-01-07 05:33:15,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:15,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296909429] [2021-01-07 05:33:15,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:15,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296909429] [2021-01-07 05:33:15,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:15,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:33:15,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697983370] [2021-01-07 05:33:15,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:33:15,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:15,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:33:15,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:33:15,520 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 10 states. [2021-01-07 05:33:16,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:16,089 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2021-01-07 05:33:16,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:33:16,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2021-01-07 05:33:16,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:16,091 INFO L225 Difference]: With dead ends: 102 [2021-01-07 05:33:16,091 INFO L226 Difference]: Without dead ends: 102 [2021-01-07 05:33:16,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2021-01-07 05:33:16,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-01-07 05:33:16,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2021-01-07 05:33:16,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2021-01-07 05:33:16,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2021-01-07 05:33:16,095 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 32 [2021-01-07 05:33:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:16,095 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2021-01-07 05:33:16,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:33:16,096 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2021-01-07 05:33:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-07 05:33:16,096 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:16,096 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:16,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-07 05:33:16,097 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:16,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:16,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1817722526, now seen corresponding path program 1 times [2021-01-07 05:33:16,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:16,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708469249] [2021-01-07 05:33:16,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:16,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708469249] [2021-01-07 05:33:16,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:16,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:33:16,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006190015] [2021-01-07 05:33:16,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:33:16,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:16,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:33:16,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:33:16,204 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand 10 states. [2021-01-07 05:33:16,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:16,646 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2021-01-07 05:33:16,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 05:33:16,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2021-01-07 05:33:16,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:16,651 INFO L225 Difference]: With dead ends: 101 [2021-01-07 05:33:16,651 INFO L226 Difference]: Without dead ends: 101 [2021-01-07 05:33:16,652 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:33:16,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-01-07 05:33:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2021-01-07 05:33:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2021-01-07 05:33:16,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2021-01-07 05:33:16,655 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 33 [2021-01-07 05:33:16,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:16,655 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2021-01-07 05:33:16,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:33:16,655 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2021-01-07 05:33:16,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-07 05:33:16,655 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:16,656 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:16,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-07 05:33:16,656 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:16,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:16,659 INFO L82 PathProgramCache]: Analyzing trace with hash 514823593, now seen corresponding path program 1 times [2021-01-07 05:33:16,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:16,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988871280] [2021-01-07 05:33:16,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:16,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988871280] [2021-01-07 05:33:16,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:16,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:33:16,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292133600] [2021-01-07 05:33:16,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:33:16,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:16,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:33:16,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:33:16,769 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 10 states. [2021-01-07 05:33:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:17,254 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2021-01-07 05:33:17,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:33:17,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2021-01-07 05:33:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:17,255 INFO L225 Difference]: With dead ends: 108 [2021-01-07 05:33:17,255 INFO L226 Difference]: Without dead ends: 108 [2021-01-07 05:33:17,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2021-01-07 05:33:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-01-07 05:33:17,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2021-01-07 05:33:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2021-01-07 05:33:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2021-01-07 05:33:17,259 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 34 [2021-01-07 05:33:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:17,259 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2021-01-07 05:33:17,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:33:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2021-01-07 05:33:17,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-07 05:33:17,260 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:17,260 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:17,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-07 05:33:17,261 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:17,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:17,261 INFO L82 PathProgramCache]: Analyzing trace with hash 528182903, now seen corresponding path program 1 times [2021-01-07 05:33:17,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:17,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469170189] [2021-01-07 05:33:17,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:17,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:17,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469170189] [2021-01-07 05:33:17,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167586541] [2021-01-07 05:33:17,652 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:33:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:18,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 72 conjunts are in the unsatisfiable core [2021-01-07 05:33:18,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:18,055 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-01-07 05:33:18,056 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2021-01-07 05:33:18,057 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:18,067 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:18,068 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:18,068 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2021-01-07 05:33:18,357 INFO L348 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2021-01-07 05:33:18,358 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 69 [2021-01-07 05:33:18,361 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:33:18,363 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:33:18,369 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:18,389 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:18,391 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:18,391 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:39 [2021-01-07 05:33:18,700 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:33:18,701 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:18,732 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:18,733 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:18,734 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2021-01-07 05:33:18,840 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-01-07 05:33:18,842 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:18,864 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:18,866 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:18,866 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2021-01-07 05:33:19,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:19,035 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-01-07 05:33:19,037 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:19,066 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:19,069 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:33:19,069 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:62 [2021-01-07 05:33:19,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:19,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:19,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:19,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:19,236 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:19,237 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 77 [2021-01-07 05:33:19,242 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:19,278 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:19,283 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:33:19,283 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:92 [2021-01-07 05:33:19,890 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 108 [2021-01-07 05:33:19,892 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:19,928 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:19,930 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:33:19,931 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:174, output treesize:135 [2021-01-07 05:33:20,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:20,399 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:20,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:20,401 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:20,402 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:20,421 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:20,421 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 119 treesize of output 65 [2021-01-07 05:33:20,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:33:20,427 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:20,445 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:20,452 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:20,452 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:136, output treesize:24 [2021-01-07 05:33:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:20,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:33:20,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 38 [2021-01-07 05:33:20,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30650071] [2021-01-07 05:33:20,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-01-07 05:33:20,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:20,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-01-07 05:33:20,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1352, Unknown=0, NotChecked=0, Total=1482 [2021-01-07 05:33:20,592 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 39 states. [2021-01-07 05:33:21,555 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2021-01-07 05:33:21,744 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2021-01-07 05:33:21,982 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2021-01-07 05:33:22,259 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2021-01-07 05:33:22,651 WARN L197 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2021-01-07 05:33:23,200 WARN L197 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 109 [2021-01-07 05:33:23,938 WARN L197 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 138 [2021-01-07 05:33:24,880 WARN L197 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 146 [2021-01-07 05:33:25,779 WARN L197 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 148 [2021-01-07 05:33:26,565 WARN L197 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 146 [2021-01-07 05:33:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:27,506 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2021-01-07 05:33:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-07 05:33:27,507 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 34 [2021-01-07 05:33:27,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:27,508 INFO L225 Difference]: With dead ends: 109 [2021-01-07 05:33:27,508 INFO L226 Difference]: Without dead ends: 109 [2021-01-07 05:33:27,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=476, Invalid=2604, Unknown=0, NotChecked=0, Total=3080 [2021-01-07 05:33:27,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-01-07 05:33:27,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2021-01-07 05:33:27,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2021-01-07 05:33:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2021-01-07 05:33:27,513 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 34 [2021-01-07 05:33:27,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:27,514 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2021-01-07 05:33:27,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2021-01-07 05:33:27,514 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2021-01-07 05:33:27,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-07 05:33:27,514 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:27,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:27,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-01-07 05:33:27,715 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:27,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:27,716 INFO L82 PathProgramCache]: Analyzing trace with hash 528182904, now seen corresponding path program 1 times [2021-01-07 05:33:27,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:27,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304702629] [2021-01-07 05:33:27,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:28,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304702629] [2021-01-07 05:33:28,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491650757] [2021-01-07 05:33:28,269 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:33:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:28,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 87 conjunts are in the unsatisfiable core [2021-01-07 05:33:28,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:28,429 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_55|], 3=[|v_#valid_70|]} [2021-01-07 05:33:28,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:28,435 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-01-07 05:33:28,436 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:28,453 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:28,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:28,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:28,467 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-01-07 05:33:28,469 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:28,484 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:28,485 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:28,486 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:32 [2021-01-07 05:33:28,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:28,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:28,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:28,780 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-01-07 05:33:28,782 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:28,818 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:28,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:28,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:28,832 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:28,832 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 18 [2021-01-07 05:33:28,835 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:33:28,837 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:28,865 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:28,866 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:28,867 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:43 [2021-01-07 05:33:29,275 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:33:29,276 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:29,325 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:29,334 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:33:29,335 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:29,377 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:29,379 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:29,379 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:60 [2021-01-07 05:33:29,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:29,507 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 69 [2021-01-07 05:33:29,509 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:29,606 INFO L625 ElimStorePlain]: treesize reduction 15, result has 88.5 percent of original size [2021-01-07 05:33:29,614 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 46 [2021-01-07 05:33:29,616 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:29,673 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:29,674 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:29,674 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:139, output treesize:92 [2021-01-07 05:33:29,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:29,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-01-07 05:33:29,965 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:30,020 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:30,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:30,031 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:30,044 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:30,045 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 72 [2021-01-07 05:33:30,049 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:30,106 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:30,109 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:30,109 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:117, output treesize:110 [2021-01-07 05:33:30,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:30,297 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:30,297 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 78 [2021-01-07 05:33:30,301 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:30,454 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2021-01-07 05:33:30,455 INFO L625 ElimStorePlain]: treesize reduction 38, result has 77.6 percent of original size [2021-01-07 05:33:30,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:30,485 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:30,485 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 1 case distinctions, treesize of input 43 treesize of output 86 [2021-01-07 05:33:30,489 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:30,636 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2021-01-07 05:33:30,638 INFO L625 ElimStorePlain]: treesize reduction 38, result has 77.1 percent of original size [2021-01-07 05:33:30,642 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:30,643 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:136, output treesize:248 [2021-01-07 05:33:31,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:31,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:31,870 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:31,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:31,901 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:31,902 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 4 case distinctions, treesize of input 343 treesize of output 157 [2021-01-07 05:33:31,911 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:33:31,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:33:31,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:33:31,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:33:31,917 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:33:31,919 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:33:31,922 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:33:31,923 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:33:31,925 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:33:31,928 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:33:31,931 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:33:31,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:33:31,934 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:33:31,937 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:33:31,939 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:33:31,943 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:33:31,944 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:33:31,947 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:33:31,952 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:33:31,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:33:31,957 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:33:31,967 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:33:31,973 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:33:31,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:33:31,977 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:33:31,979 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:33:31,984 INFO L547 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:32,118 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2021-01-07 05:33:32,119 INFO L625 ElimStorePlain]: treesize reduction 8, result has 95.3 percent of original size [2021-01-07 05:33:32,127 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:32,127 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:408, output treesize:160 [2021-01-07 05:33:32,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:32,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:32,365 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:32,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:32,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:32,369 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:32,370 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:32,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:32,416 INFO L348 Elim1Store]: treesize reduction 16, result has 69.2 percent of original size [2021-01-07 05:33:32,417 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 134 treesize of output 73 [2021-01-07 05:33:32,420 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:33:32,423 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:32,472 INFO L625 ElimStorePlain]: treesize reduction 4, result has 91.5 percent of original size [2021-01-07 05:33:32,476 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:32,476 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:157, output treesize:31 [2021-01-07 05:33:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:32,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:33:32,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 39 [2021-01-07 05:33:32,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797140666] [2021-01-07 05:33:32,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-01-07 05:33:32,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:32,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-01-07 05:33:32,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1447, Unknown=0, NotChecked=0, Total=1560 [2021-01-07 05:33:32,661 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 40 states. [2021-01-07 05:33:33,642 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2021-01-07 05:33:33,856 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2021-01-07 05:33:34,093 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2021-01-07 05:33:34,421 WARN L197 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2021-01-07 05:33:34,674 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 82 [2021-01-07 05:33:35,043 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 79 [2021-01-07 05:33:35,586 WARN L197 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 92 [2021-01-07 05:33:36,254 WARN L197 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 133 [2021-01-07 05:33:37,082 WARN L197 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 176 [2021-01-07 05:33:38,159 WARN L197 SmtUtils]: Spent 920.00 ms on a formula simplification. DAG size of input: 267 DAG size of output: 228 [2021-01-07 05:33:39,285 WARN L197 SmtUtils]: Spent 977.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 232 [2021-01-07 05:33:40,502 WARN L197 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 280 DAG size of output: 234 [2021-01-07 05:33:41,666 WARN L197 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 230 [2021-01-07 05:33:42,888 WARN L197 SmtUtils]: Spent 849.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 220 [2021-01-07 05:33:48,209 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-01-07 05:33:49,062 WARN L197 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 136 [2021-01-07 05:33:50,071 WARN L197 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 123 [2021-01-07 05:33:51,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:51,371 INFO L93 Difference]: Finished difference Result 175 states and 188 transitions. [2021-01-07 05:33:51,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-01-07 05:33:51,372 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 34 [2021-01-07 05:33:51,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:51,374 INFO L225 Difference]: With dead ends: 175 [2021-01-07 05:33:51,374 INFO L226 Difference]: Without dead ends: 175 [2021-01-07 05:33:51,376 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=514, Invalid=3392, Unknown=0, NotChecked=0, Total=3906 [2021-01-07 05:33:51,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-01-07 05:33:51,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 96. [2021-01-07 05:33:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2021-01-07 05:33:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2021-01-07 05:33:51,380 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 34 [2021-01-07 05:33:51,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:51,380 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2021-01-07 05:33:51,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2021-01-07 05:33:51,380 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2021-01-07 05:33:51,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-07 05:33:51,380 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:51,381 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:51,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:33:51,594 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:51,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:51,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1220337663, now seen corresponding path program 1 times [2021-01-07 05:33:51,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:51,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507899333] [2021-01-07 05:33:51,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:51,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507899333] [2021-01-07 05:33:51,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325844090] [2021-01-07 05:33:51,765 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:33:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:51,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-07 05:33:51,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:52,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:52,002 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-01-07 05:33:52,003 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:52,011 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:52,012 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:52,013 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2021-01-07 05:33:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:33:52,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:33:52,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2021-01-07 05:33:52,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114421467] [2021-01-07 05:33:52,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:33:52,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:52,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:33:52,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:33:52,056 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 7 states. [2021-01-07 05:33:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:52,346 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2021-01-07 05:33:52,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:33:52,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2021-01-07 05:33:52,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:52,348 INFO L225 Difference]: With dead ends: 102 [2021-01-07 05:33:52,348 INFO L226 Difference]: Without dead ends: 102 [2021-01-07 05:33:52,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2021-01-07 05:33:52,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-01-07 05:33:52,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2021-01-07 05:33:52,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2021-01-07 05:33:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2021-01-07 05:33:52,352 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 35 [2021-01-07 05:33:52,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:52,353 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2021-01-07 05:33:52,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:33:52,353 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2021-01-07 05:33:52,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-07 05:33:52,353 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:52,353 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:52,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-01-07 05:33:52,568 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:52,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:52,569 INFO L82 PathProgramCache]: Analyzing trace with hash -806199100, now seen corresponding path program 1 times [2021-01-07 05:33:52,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:52,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376686916] [2021-01-07 05:33:52,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:52,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376686916] [2021-01-07 05:33:52,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:52,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-07 05:33:52,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122417931] [2021-01-07 05:33:52,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-07 05:33:52,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:52,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-07 05:33:52,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-01-07 05:33:52,777 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 14 states. [2021-01-07 05:33:53,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:53,821 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2021-01-07 05:33:53,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-07 05:33:53,821 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2021-01-07 05:33:53,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:53,822 INFO L225 Difference]: With dead ends: 104 [2021-01-07 05:33:53,822 INFO L226 Difference]: Without dead ends: 104 [2021-01-07 05:33:53,823 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=238, Invalid=574, Unknown=0, NotChecked=0, Total=812 [2021-01-07 05:33:53,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-01-07 05:33:53,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2021-01-07 05:33:53,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2021-01-07 05:33:53,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2021-01-07 05:33:53,827 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 35 [2021-01-07 05:33:53,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:53,827 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2021-01-07 05:33:53,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-07 05:33:53,827 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2021-01-07 05:33:53,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-07 05:33:53,828 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:53,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:53,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-07 05:33:53,828 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:33:53,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:53,829 INFO L82 PathProgramCache]: Analyzing trace with hash -806199099, now seen corresponding path program 1 times [2021-01-07 05:33:53,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:53,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348153093] [2021-01-07 05:33:53,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:54,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348153093] [2021-01-07 05:33:54,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888833557] [2021-01-07 05:33:54,252 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:33:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:54,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 58 conjunts are in the unsatisfiable core [2021-01-07 05:33:54,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:54,741 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:33:54,745 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:54,758 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:54,762 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:33:54,764 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:54,777 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:54,779 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:54,779 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2021-01-07 05:33:55,144 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:55,144 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 68 [2021-01-07 05:33:55,146 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:33:55,149 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:33:55,150 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:55,167 INFO L625 ElimStorePlain]: treesize reduction 18, result has 71.0 percent of original size [2021-01-07 05:33:55,177 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:55,178 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 31 [2021-01-07 05:33:55,182 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:55,188 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:55,189 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:55,189 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:87, output treesize:11 [2021-01-07 05:33:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:55,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:33:55,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 29 [2021-01-07 05:33:55,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241116082] [2021-01-07 05:33:55,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-01-07 05:33:55,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:55,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-01-07 05:33:55,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=801, Unknown=0, NotChecked=0, Total=870 [2021-01-07 05:33:55,315 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 30 states. [2021-01-07 05:33:56,658 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2021-01-07 05:33:56,880 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2021-01-07 05:33:57,156 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 81 [2021-01-07 05:33:57,564 WARN L197 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 108 [2021-01-07 05:33:57,951 WARN L197 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 113 [2021-01-07 05:33:58,283 WARN L197 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 86 [2021-01-07 05:33:58,533 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2021-01-07 05:33:58,756 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2021-01-07 05:33:59,311 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2021-01-07 05:33:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:59,920 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2021-01-07 05:33:59,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-07 05:33:59,921 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 35 [2021-01-07 05:33:59,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:59,921 INFO L225 Difference]: With dead ends: 147 [2021-01-07 05:33:59,922 INFO L226 Difference]: Without dead ends: 147 [2021-01-07 05:33:59,923 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=486, Invalid=2166, Unknown=0, NotChecked=0, Total=2652 [2021-01-07 05:33:59,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-01-07 05:33:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 96. [2021-01-07 05:33:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2021-01-07 05:33:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2021-01-07 05:33:59,926 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 35 [2021-01-07 05:33:59,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:59,926 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2021-01-07 05:33:59,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2021-01-07 05:33:59,926 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2021-01-07 05:33:59,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-07 05:33:59,927 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:59,927 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:00,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-01-07 05:34:00,142 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:34:00,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:00,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1663218810, now seen corresponding path program 1 times [2021-01-07 05:34:00,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:00,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694296811] [2021-01-07 05:34:00,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:34:00,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694296811] [2021-01-07 05:34:00,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086045958] [2021-01-07 05:34:00,987 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:01,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 92 conjunts are in the unsatisfiable core [2021-01-07 05:34:01,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:34:01,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:01,379 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-01-07 05:34:01,381 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:01,400 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:01,401 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:01,402 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:27 [2021-01-07 05:34:01,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:01,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:01,751 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:01,752 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2021-01-07 05:34:01,754 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:01,832 INFO L625 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2021-01-07 05:34:01,833 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:01,834 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:45 [2021-01-07 05:34:02,079 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:34:02,080 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:02,124 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:02,125 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:02,126 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:57 [2021-01-07 05:34:02,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:02,282 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-01-07 05:34:02,283 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:02,320 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:02,323 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:02,323 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:76, output treesize:57 [2021-01-07 05:34:02,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:02,642 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-01-07 05:34:02,646 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:02,750 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2021-01-07 05:34:02,751 INFO L625 ElimStorePlain]: treesize reduction 3, result has 95.7 percent of original size [2021-01-07 05:34:02,753 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:34:02,754 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:67 [2021-01-07 05:34:02,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:02,985 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:02,986 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 30 treesize of output 94 [2021-01-07 05:34:02,992 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:03,128 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2021-01-07 05:34:03,129 INFO L625 ElimStorePlain]: treesize reduction 46, result has 62.9 percent of original size [2021-01-07 05:34:03,131 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:34:03,132 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:34:03,133 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:78 [2021-01-07 05:34:03,135 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:34:03,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:34:03,654 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2021-01-07 05:34:03,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:03,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:03,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:03,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:34:03,716 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:34:03,737 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:03,738 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 3 case distinctions, treesize of input 37 treesize of output 66 [2021-01-07 05:34:03,740 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:03,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:03,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:03,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:34:03,756 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-01-07 05:34:03,759 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:04,022 WARN L197 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2021-01-07 05:34:04,023 INFO L625 ElimStorePlain]: treesize reduction 33, result has 80.0 percent of original size [2021-01-07 05:34:04,025 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 2 xjuncts. [2021-01-07 05:34:04,026 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:150, output treesize:132 [2021-01-07 05:34:04,276 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-01-07 05:34:04,290 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 14, 1] term [2021-01-07 05:34:04,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:04,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:04,305 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_43|], 6=[v_prenex_1], 20=[|v_#memory_$Pointer$.base_52|]} [2021-01-07 05:34:04,319 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:34:04,320 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:04,332 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:34:04,333 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:04,487 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2021-01-07 05:34:04,488 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:04,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:04,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:04,501 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:34:04,506 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 30 treesize of output 23 [2021-01-07 05:34:04,508 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:04,645 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-01-07 05:34:04,646 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:04,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:04,656 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:34:04,657 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:34:04,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:04,661 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:34:04,685 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:04,686 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 89 [2021-01-07 05:34:04,689 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:04,935 WARN L197 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2021-01-07 05:34:04,936 INFO L625 ElimStorePlain]: treesize reduction 56, result has 75.0 percent of original size [2021-01-07 05:34:04,942 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-01-07 05:34:04,943 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:194, output treesize:198 [2021-01-07 05:34:05,186 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2021-01-07 05:34:06,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:06,406 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:34:06,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:06,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:34:06,518 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-01-07 05:34:06,519 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:06,519 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 214 treesize of output 253 [2021-01-07 05:34:06,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:34:06,534 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:34:06,577 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:06,579 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:34:06,580 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:243, output treesize:86 [2021-01-07 05:34:06,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:07,024 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:07,025 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 148 [2021-01-07 05:34:07,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:34:07,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:34:07,030 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:34:07,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:34:07,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:34:07,035 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:34:07,037 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:34:07,151 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2021-01-07 05:34:07,152 INFO L625 ElimStorePlain]: treesize reduction 56, result has 55.6 percent of original size [2021-01-07 05:34:07,154 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:34:07,155 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:75 [2021-01-07 05:34:07,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:07,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:07,427 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:07,428 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 33 treesize of output 33 [2021-01-07 05:34:07,430 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:07,516 INFO L625 ElimStorePlain]: treesize reduction 13, result has 88.3 percent of original size [2021-01-07 05:34:07,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:07,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:07,590 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:07,591 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 136 [2021-01-07 05:34:07,597 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2021-01-07 05:34:07,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:34:07,606 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:07,746 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2021-01-07 05:34:07,747 INFO L625 ElimStorePlain]: treesize reduction 162, result has 43.0 percent of original size [2021-01-07 05:34:07,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:07,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:07,758 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:07,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:07,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:34:07,767 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-01-07 05:34:07,768 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:130, output treesize:140 [2021-01-07 05:34:07,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:07,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:07,774 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:07,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:07,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:34:14,016 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:14,019 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:14,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:34:14,024 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:34:14,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:14,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:14,095 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:14,095 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 84 [2021-01-07 05:34:14,098 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:34:14,099 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:34:14,099 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:34:14,102 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:34:14,113 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:14,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:14,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:14,141 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:14,142 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 41 [2021-01-07 05:34:14,144 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:34:14,148 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:14,216 INFO L625 ElimStorePlain]: treesize reduction 121, result has 14.8 percent of original size [2021-01-07 05:34:14,219 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:34:14,219 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:178, output treesize:7 [2021-01-07 05:34:14,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:34:14,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:34:14,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 45 [2021-01-07 05:34:14,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113486874] [2021-01-07 05:34:14,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-01-07 05:34:14,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:14,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-01-07 05:34:14,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1947, Unknown=3, NotChecked=0, Total=2070 [2021-01-07 05:34:14,309 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 46 states. [2021-01-07 05:34:15,210 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2021-01-07 05:34:15,487 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2021-01-07 05:34:15,876 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2021-01-07 05:34:16,295 WARN L197 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2021-01-07 05:34:16,749 WARN L197 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 82 [2021-01-07 05:34:17,275 WARN L197 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 91 [2021-01-07 05:34:17,918 WARN L197 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 95 [2021-01-07 05:34:18,455 WARN L197 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 81 [2021-01-07 05:34:19,067 WARN L197 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 84 [2021-01-07 05:34:19,503 WARN L197 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2021-01-07 05:34:20,054 WARN L197 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 113 [2021-01-07 05:34:20,858 WARN L197 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 146 [2021-01-07 05:34:22,147 WARN L197 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 257 DAG size of output: 189 [2021-01-07 05:34:23,495 WARN L197 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 267 DAG size of output: 199 [2021-01-07 05:34:24,938 WARN L197 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 272 DAG size of output: 204 [2021-01-07 05:34:26,187 WARN L197 SmtUtils]: Spent 993.00 ms on a formula simplification. DAG size of input: 260 DAG size of output: 194 [2021-01-07 05:34:27,706 WARN L197 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 264 DAG size of output: 198 [2021-01-07 05:34:29,201 WARN L197 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 279 DAG size of output: 218 [2021-01-07 05:34:30,779 WARN L197 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 272 DAG size of output: 202 [2021-01-07 05:34:32,039 WARN L197 SmtUtils]: Spent 969.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 189 [2021-01-07 05:34:41,042 WARN L197 SmtUtils]: Spent 4.67 s on a formula simplification. DAG size of input: 170 DAG size of output: 153 [2021-01-07 05:34:42,044 WARN L197 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 150 [2021-01-07 05:34:44,726 WARN L197 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2021-01-07 05:34:45,506 WARN L197 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 99 [2021-01-07 05:34:46,171 WARN L197 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 108 [2021-01-07 05:34:51,471 WARN L197 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2021-01-07 05:34:54,148 WARN L197 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2021-01-07 05:34:55,170 WARN L197 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2021-01-07 05:34:57,782 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2021-01-07 05:34:58,208 WARN L197 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2021-01-07 05:34:58,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:58,731 INFO L93 Difference]: Finished difference Result 173 states and 178 transitions. [2021-01-07 05:34:58,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-01-07 05:34:58,731 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 37 [2021-01-07 05:34:58,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:58,733 INFO L225 Difference]: With dead ends: 173 [2021-01-07 05:34:58,733 INFO L226 Difference]: Without dead ends: 173 [2021-01-07 05:34:58,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 44.6s TimeCoverageRelationStatistics Valid=891, Invalid=5748, Unknown=3, NotChecked=0, Total=6642 [2021-01-07 05:34:58,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-01-07 05:34:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 98. [2021-01-07 05:34:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2021-01-07 05:34:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2021-01-07 05:34:58,739 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 37 [2021-01-07 05:34:58,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:58,739 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2021-01-07 05:34:58,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2021-01-07 05:34:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2021-01-07 05:34:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-07 05:34:58,740 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:58,740 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:58,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-01-07 05:34:58,948 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:34:58,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:58,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1818946726, now seen corresponding path program 1 times [2021-01-07 05:34:58,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:58,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509240244] [2021-01-07 05:34:58,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:34:58,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509240244] [2021-01-07 05:34:58,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:58,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:34:58,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713649466] [2021-01-07 05:34:58,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:34:58,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:58,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:34:58,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:34:58,995 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 4 states. [2021-01-07 05:34:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:59,114 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2021-01-07 05:34:59,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:34:59,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2021-01-07 05:34:59,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:59,116 INFO L225 Difference]: With dead ends: 96 [2021-01-07 05:34:59,116 INFO L226 Difference]: Without dead ends: 96 [2021-01-07 05:34:59,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:34:59,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-01-07 05:34:59,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-01-07 05:34:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2021-01-07 05:34:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2021-01-07 05:34:59,120 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 38 [2021-01-07 05:34:59,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:59,120 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2021-01-07 05:34:59,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:34:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2021-01-07 05:34:59,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-07 05:34:59,121 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:59,121 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:59,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-07 05:34:59,121 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2021-01-07 05:34:59,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:59,122 INFO L82 PathProgramCache]: Analyzing trace with hash -20175398, now seen corresponding path program 1 times [2021-01-07 05:34:59,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:59,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508619637] [2021-01-07 05:34:59,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:35:00,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:35:00,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508619637] [2021-01-07 05:35:00,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135753000] [2021-01-07 05:35:00,222 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:35:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:35:00,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 64 conjunts are in the unsatisfiable core [2021-01-07 05:35:00,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:35:00,697 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_59|], 1=[|v_#valid_74|]} [2021-01-07 05:35:00,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:00,705 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-01-07 05:35:00,707 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:00,729 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:00,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:00,737 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 5 treesize of output 3 [2021-01-07 05:35:00,739 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:00,757 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:00,758 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:00,758 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2021-01-07 05:35:01,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:01,118 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:35:01,124 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:01,139 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:01,140 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:01,141 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:16 [2021-01-07 05:35:01,552 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:35:01,553 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:01,575 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:01,576 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:35:01,576 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2021-01-07 05:35:02,471 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 22 treesize of output 10 [2021-01-07 05:35:02,473 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:02,500 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:02,501 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:35:02,502 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:43 [2021-01-07 05:35:03,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,028 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:03,129 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:03,129 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 146 [2021-01-07 05:35:03,132 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:35:03,133 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:03,134 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:35:03,134 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:35:03,135 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:03,136 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:35:03,137 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:03,138 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:35:03,139 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:35:03,139 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:03,140 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:03,141 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:03,143 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:35:03,143 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:03,144 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:35:03,144 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:03,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:03,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:03,150 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:35:03,151 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:35:03,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:35:03,152 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:03,153 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:03,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:03,155 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:35:03,155 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:35:03,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:03,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:35:03,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:03,160 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:35:03,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:35:03,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:03,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:03,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:03,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:35:03,165 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:03,166 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:35:03,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:03,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:03,168 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:03,169 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:35:03,170 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:03,170 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:03,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:35:03,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:03,173 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:03,174 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:35:03,316 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 35 [2021-01-07 05:35:03,317 INFO L625 ElimStorePlain]: treesize reduction 79, result has 41.9 percent of original size [2021-01-07 05:35:03,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:03,323 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:03,324 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:03,327 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:35:03,327 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2021-01-07 05:35:03,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:03,330 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:03,331 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:03,528 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:03,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:03,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:35:03,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,687 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2021-01-07 05:35:03,688 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:03,689 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 162 [2021-01-07 05:35:03,701 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2021-01-07 05:35:03,701 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:35:03,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:03,703 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2021-01-07 05:35:03,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:35:03,704 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:35:03,705 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:35:03,705 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:35:03,706 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:35:03,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:35:03,707 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:35:03,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:03,709 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:35:03,711 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:35:03,713 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:35:03,714 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:35:03,715 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:35:03,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:35:03,716 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:35:03,717 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:35:03,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:35:03,719 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:35:03,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:03,724 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:35:03,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:35:03,726 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:35:03,726 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:35:03,727 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:35:03,728 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:35:03,729 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:03,730 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:35:03,731 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:35:03,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:35:03,735 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:35:03,735 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:35:03,736 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:35:03,737 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:35:03,738 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:35:03,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:35:03,740 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:35:03,742 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2021-01-07 05:35:03,742 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:35:03,744 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:35:03,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,824 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:03,825 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 87 [2021-01-07 05:35:03,828 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2021-01-07 05:35:03,828 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:03,833 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-01-07 05:35:04,267 WARN L197 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 54 [2021-01-07 05:35:04,268 INFO L625 ElimStorePlain]: treesize reduction 283, result has 37.1 percent of original size [2021-01-07 05:35:04,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:04,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:04,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:04,278 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:04,280 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:04,286 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2021-01-07 05:35:04,287 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:04,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:04,293 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2021-01-07 05:35:04,293 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:127, output treesize:170 [2021-01-07 05:35:04,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:04,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:04,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:04,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:04,304 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:04,305 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:12,645 WARN L197 SmtUtils]: Spent 8.05 s on a formula simplification that was a NOOP. DAG size: 62 [2021-01-07 05:35:12,654 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2021-01-07 05:35:12,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:12,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:12,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:12,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:12,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:12,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:12,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:12,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:12,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:12,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:12,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:12,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:12,688 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:12,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:35:12,703 INFO L443 ElimStorePlain]: Different costs {2=[v_prenex_5], 6=[v_prenex_6], 20=[|#memory_$Pointer$.base|]} [2021-01-07 05:35:12,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:12,717 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:12,717 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 13 [2021-01-07 05:35:12,721 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:12,847 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-01-07 05:35:12,847 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:12,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:12,884 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:12,885 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 45 [2021-01-07 05:35:12,889 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:35:12,891 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:35:12,896 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2021-01-07 05:35:13,090 WARN L197 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2021-01-07 05:35:13,092 INFO L625 ElimStorePlain]: treesize reduction 37, result has 78.0 percent of original size [2021-01-07 05:35:13,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:13,169 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:13,170 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 92 [2021-01-07 05:35:13,174 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:35:13,175 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:35:13,175 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:35:13,182 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2021-01-07 05:35:13,184 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2021-01-07 05:35:13,187 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:13,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:13,218 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:13,219 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 46 [2021-01-07 05:35:13,220 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:13,253 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:13,258 INFO L547 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:13,259 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:235, output treesize:3 [2021-01-07 05:35:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:35:13,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:35:13,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 41 [2021-01-07 05:35:13,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551606941] [2021-01-07 05:35:13,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-01-07 05:35:13,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:35:13,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-01-07 05:35:13,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1615, Unknown=0, NotChecked=0, Total=1722 [2021-01-07 05:35:13,324 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 42 states. [2021-01-07 05:35:14,175 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-01-07 05:35:14,477 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2021-01-07 05:35:15,018 WARN L197 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2021-01-07 05:35:15,427 WARN L197 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2021-01-07 05:35:15,911 WARN L197 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2021-01-07 05:35:16,350 WARN L197 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2021-01-07 05:35:16,774 WARN L197 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 57 [2021-01-07 05:35:17,209 WARN L197 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2021-01-07 05:35:17,717 WARN L197 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 85 [2021-01-07 05:35:20,497 WARN L197 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 105 [2021-01-07 05:35:23,325 WARN L197 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 112 [2021-01-07 05:35:26,219 WARN L197 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 116 [2021-01-07 05:35:29,089 WARN L197 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 109 [2021-01-07 05:35:32,253 WARN L197 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 116 [2021-01-07 05:35:35,268 WARN L197 SmtUtils]: Spent 789.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 122 [2021-01-07 05:35:38,345 WARN L197 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 118 [2021-01-07 05:35:43,111 WARN L197 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 102 [2021-01-07 05:35:48,261 WARN L197 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 129 [2021-01-07 05:35:48,732 WARN L197 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2021-01-07 05:36:30,143 WARN L197 SmtUtils]: Spent 29.00 s on a formula simplification. DAG size of input: 197 DAG size of output: 158 [2021-01-07 05:36:59,485 WARN L197 SmtUtils]: Spent 29.09 s on a formula simplification. DAG size of input: 200 DAG size of output: 161