/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/sll2c_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 05:39:19,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 05:39:19,814 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 05:39:19,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 05:39:19,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 05:39:19,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 05:39:19,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 05:39:19,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 05:39:19,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 05:39:19,870 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 05:39:19,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 05:39:19,874 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 05:39:19,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 05:39:19,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 05:39:19,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 05:39:19,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 05:39:19,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 05:39:19,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 05:39:19,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 05:39:19,914 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 05:39:19,917 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 05:39:19,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 05:39:19,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 05:39:19,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 05:39:19,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 05:39:19,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 05:39:19,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 05:39:19,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 05:39:19,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 05:39:19,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 05:39:19,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 05:39:19,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 05:39:19,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 05:39:19,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 05:39:19,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 05:39:19,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 05:39:19,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 05:39:19,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 05:39:19,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 05:39:19,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 05:39:19,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 05:39:19,947 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:39:19,981 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 05:39:19,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 05:39:19,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 05:39:19,984 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 05:39:19,984 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 05:39:19,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 05:39:19,985 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-01-07 05:39:19,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 05:39:19,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 05:39:19,986 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-01-07 05:39:19,986 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-01-07 05:39:19,986 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-01-07 05:39:19,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 05:39:19,987 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-01-07 05:39:19,987 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 05:39:19,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 05:39:19,988 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 05:39:19,988 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 05:39:19,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:39:19,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 05:39:19,989 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 05:39:19,989 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 05:39:19,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 05:39:19,989 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 05:39:19,990 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:39:20,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 05:39:20,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 05:39:20,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 05:39:20,496 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 05:39:20,497 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 05:39:20,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-01-07 05:39:20,604 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/71f4d67c7/a7f22a1b21054f519a12fe06f25ee15f/FLAG73ac50b50 [2021-01-07 05:39:21,427 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 05:39:21,428 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-01-07 05:39:21,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/71f4d67c7/a7f22a1b21054f519a12fe06f25ee15f/FLAG73ac50b50 [2021-01-07 05:39:21,690 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/71f4d67c7/a7f22a1b21054f519a12fe06f25ee15f [2021-01-07 05:39:21,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 05:39:21,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 05:39:21,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 05:39:21,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 05:39:21,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 05:39:21,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:39:21" (1/1) ... [2021-01-07 05:39:21,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b6395f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:39:21, skipping insertion in model container [2021-01-07 05:39:21,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:39:21" (1/1) ... [2021-01-07 05:39:21,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 05:39:21,800 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[~new_head~0,],base],StructAccessExpression[IdentifierExpression[~new_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: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~head,] left hand side expression in assignment: lhs: VariableLHS[~head,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] [2021-01-07 05:39:22,180 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/sll2c_update_all.i[24418,24431] [2021-01-07 05:39:22,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:39:22,213 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[~new_head~0,],base],StructAccessExpression[IdentifierExpression[~new_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: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~head,] left hand side expression in assignment: lhs: VariableLHS[~head,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] [2021-01-07 05:39:22,293 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/sll2c_update_all.i[24418,24431] [2021-01-07 05:39:22,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:39:22,440 INFO L208 MainTranslator]: Completed translation [2021-01-07 05:39:22,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:39:22 WrapperNode [2021-01-07 05:39:22,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 05:39:22,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 05:39:22,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 05:39:22,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 05:39:22,481 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:39:22" (1/1) ... [2021-01-07 05:39:22,532 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:39:22" (1/1) ... [2021-01-07 05:39:22,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 05:39:22,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 05:39:22,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 05:39:22,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 05:39:22,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:39:22" (1/1) ... [2021-01-07 05:39:22,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:39:22" (1/1) ... [2021-01-07 05:39:22,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:39:22" (1/1) ... [2021-01-07 05:39:22,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:39:22" (1/1) ... [2021-01-07 05:39:22,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:39:22" (1/1) ... [2021-01-07 05:39:22,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:39:22" (1/1) ... [2021-01-07 05:39:22,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:39:22" (1/1) ... [2021-01-07 05:39:22,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 05:39:22,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 05:39:22,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 05:39:22,683 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 05:39:22,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:39:22" (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:39:22,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 05:39:22,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 05:39:22,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 05:39:22,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 05:39:22,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 05:39:22,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 05:39:22,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 05:39:22,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 05:39:22,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 05:39:22,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 05:39:23,466 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 05:39:23,466 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-01-07 05:39:23,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:39:23 BoogieIcfgContainer [2021-01-07 05:39:23,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 05:39:23,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 05:39:23,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 05:39:23,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 05:39:23,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 05:39:21" (1/3) ... [2021-01-07 05:39:23,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4980f4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:39:23, skipping insertion in model container [2021-01-07 05:39:23,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:39:22" (2/3) ... [2021-01-07 05:39:23,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4980f4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:39:23, skipping insertion in model container [2021-01-07 05:39:23,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:39:23" (3/3) ... [2021-01-07 05:39:23,479 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2021-01-07 05:39:23,487 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 05:39:23,494 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 32 error locations. [2021-01-07 05:39:23,517 INFO L253 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2021-01-07 05:39:23,548 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 05:39:23,548 INFO L378 AbstractCegarLoop]: Hoare is false [2021-01-07 05:39:23,549 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 05:39:23,549 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 05:39:23,549 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 05:39:23,549 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 05:39:23,549 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 05:39:23,549 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 05:39:23,572 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2021-01-07 05:39:23,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-01-07 05:39:23,581 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:23,582 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-01-07 05:39:23,583 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:23,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:23,591 INFO L82 PathProgramCache]: Analyzing trace with hash 925702, now seen corresponding path program 1 times [2021-01-07 05:39:23,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:23,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476579665] [2021-01-07 05:39:23,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:23,870 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:39:23,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476579665] [2021-01-07 05:39:23,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:39:23,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:39:23,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457496169] [2021-01-07 05:39:23,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:39:23,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:23,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:39:23,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:39:23,915 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2021-01-07 05:39:24,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:24,115 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2021-01-07 05:39:24,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:39:24,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2021-01-07 05:39:24,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:24,135 INFO L225 Difference]: With dead ends: 104 [2021-01-07 05:39:24,135 INFO L226 Difference]: Without dead ends: 98 [2021-01-07 05:39:24,148 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:39:24,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-01-07 05:39:24,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2021-01-07 05:39:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2021-01-07 05:39:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2021-01-07 05:39:24,222 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 4 [2021-01-07 05:39:24,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:24,223 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2021-01-07 05:39:24,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:39:24,224 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2021-01-07 05:39:24,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-01-07 05:39:24,225 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:24,225 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-01-07 05:39:24,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 05:39:24,227 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:24,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:24,232 INFO L82 PathProgramCache]: Analyzing trace with hash 925703, now seen corresponding path program 1 times [2021-01-07 05:39:24,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:24,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808539692] [2021-01-07 05:39:24,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:24,373 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:39:24,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808539692] [2021-01-07 05:39:24,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:39:24,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:39:24,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657971399] [2021-01-07 05:39:24,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:39:24,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:24,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:39:24,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:39:24,378 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 3 states. [2021-01-07 05:39:24,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:24,448 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2021-01-07 05:39:24,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:39:24,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2021-01-07 05:39:24,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:24,450 INFO L225 Difference]: With dead ends: 74 [2021-01-07 05:39:24,450 INFO L226 Difference]: Without dead ends: 74 [2021-01-07 05:39:24,451 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:39:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-01-07 05:39:24,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-01-07 05:39:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2021-01-07 05:39:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2021-01-07 05:39:24,460 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 4 [2021-01-07 05:39:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:24,460 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2021-01-07 05:39:24,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:39:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2021-01-07 05:39:24,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-07 05:39:24,461 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:24,462 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:39:24,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 05:39:24,463 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:24,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:24,464 INFO L82 PathProgramCache]: Analyzing trace with hash 2097994085, now seen corresponding path program 1 times [2021-01-07 05:39:24,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:24,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488706918] [2021-01-07 05:39:24,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:24,526 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:39:24,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488706918] [2021-01-07 05:39:24,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:39:24,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:39:24,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615693844] [2021-01-07 05:39:24,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:39:24,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:24,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:39:24,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:39:24,531 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 3 states. [2021-01-07 05:39:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:24,545 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2021-01-07 05:39:24,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:39:24,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2021-01-07 05:39:24,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:24,548 INFO L225 Difference]: With dead ends: 84 [2021-01-07 05:39:24,548 INFO L226 Difference]: Without dead ends: 84 [2021-01-07 05:39:24,549 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:39:24,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-01-07 05:39:24,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2021-01-07 05:39:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2021-01-07 05:39:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2021-01-07 05:39:24,558 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 9 [2021-01-07 05:39:24,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:24,558 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2021-01-07 05:39:24,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:39:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2021-01-07 05:39:24,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-07 05:39:24,563 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:24,563 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:39:24,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 05:39:24,563 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:24,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:24,564 INFO L82 PathProgramCache]: Analyzing trace with hash 231455864, now seen corresponding path program 1 times [2021-01-07 05:39:24,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:24,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139551568] [2021-01-07 05:39:24,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:24,718 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:39:24,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139551568] [2021-01-07 05:39:24,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:39:24,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:39:24,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701257830] [2021-01-07 05:39:24,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:39:24,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:24,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:39:24,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:39:24,722 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 5 states. [2021-01-07 05:39:24,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:24,946 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2021-01-07 05:39:24,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:39:24,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2021-01-07 05:39:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:24,948 INFO L225 Difference]: With dead ends: 99 [2021-01-07 05:39:24,948 INFO L226 Difference]: Without dead ends: 99 [2021-01-07 05:39:24,949 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:39:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-01-07 05:39:24,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 74. [2021-01-07 05:39:24,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2021-01-07 05:39:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2021-01-07 05:39:24,975 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 14 [2021-01-07 05:39:24,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:24,976 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2021-01-07 05:39:24,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:39:24,978 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2021-01-07 05:39:24,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-07 05:39:24,979 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:24,979 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:39:24,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 05:39:24,979 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:24,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:24,980 INFO L82 PathProgramCache]: Analyzing trace with hash 231455865, now seen corresponding path program 1 times [2021-01-07 05:39:24,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:24,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546873275] [2021-01-07 05:39:24,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:25,146 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:39:25,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546873275] [2021-01-07 05:39:25,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:39:25,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:39:25,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921328796] [2021-01-07 05:39:25,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:39:25,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:25,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:39:25,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:39:25,153 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 5 states. [2021-01-07 05:39:25,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:25,291 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2021-01-07 05:39:25,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:39:25,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2021-01-07 05:39:25,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:25,296 INFO L225 Difference]: With dead ends: 78 [2021-01-07 05:39:25,296 INFO L226 Difference]: Without dead ends: 78 [2021-01-07 05:39:25,297 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:39:25,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-01-07 05:39:25,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2021-01-07 05:39:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2021-01-07 05:39:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2021-01-07 05:39:25,317 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 14 [2021-01-07 05:39:25,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:25,317 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2021-01-07 05:39:25,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:39:25,318 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2021-01-07 05:39:25,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-07 05:39:25,320 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:25,320 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:39:25,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 05:39:25,320 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:25,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:25,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1879150547, now seen corresponding path program 1 times [2021-01-07 05:39:25,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:25,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560957038] [2021-01-07 05:39:25,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:25,481 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:39:25,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560957038] [2021-01-07 05:39:25,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:39:25,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:39:25,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893619432] [2021-01-07 05:39:25,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:39:25,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:25,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:39:25,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:39:25,486 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 6 states. [2021-01-07 05:39:25,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:25,619 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2021-01-07 05:39:25,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:39:25,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2021-01-07 05:39:25,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:25,620 INFO L225 Difference]: With dead ends: 92 [2021-01-07 05:39:25,621 INFO L226 Difference]: Without dead ends: 92 [2021-01-07 05:39:25,621 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:39:25,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-01-07 05:39:25,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2021-01-07 05:39:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2021-01-07 05:39:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2021-01-07 05:39:25,625 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 17 [2021-01-07 05:39:25,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:25,626 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2021-01-07 05:39:25,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:39:25,626 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2021-01-07 05:39:25,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-07 05:39:25,627 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:25,627 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:39:25,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 05:39:25,627 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:25,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:25,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1879150548, now seen corresponding path program 1 times [2021-01-07 05:39:25,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:25,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982493234] [2021-01-07 05:39:25,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:25,701 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:39:25,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982493234] [2021-01-07 05:39:25,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:39:25,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:39:25,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577761292] [2021-01-07 05:39:25,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:39:25,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:25,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:39:25,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:39:25,704 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 5 states. [2021-01-07 05:39:25,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:25,825 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2021-01-07 05:39:25,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:39:25,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2021-01-07 05:39:25,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:25,827 INFO L225 Difference]: With dead ends: 71 [2021-01-07 05:39:25,827 INFO L226 Difference]: Without dead ends: 71 [2021-01-07 05:39:25,829 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:39:25,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-01-07 05:39:25,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-01-07 05:39:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2021-01-07 05:39:25,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2021-01-07 05:39:25,842 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 17 [2021-01-07 05:39:25,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:25,843 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2021-01-07 05:39:25,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:39:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2021-01-07 05:39:25,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:39:25,844 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:25,844 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:39:25,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 05:39:25,846 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:25,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:25,847 INFO L82 PathProgramCache]: Analyzing trace with hash -687020393, now seen corresponding path program 1 times [2021-01-07 05:39:25,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:25,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093638788] [2021-01-07 05:39:25,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:26,002 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:39:26,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093638788] [2021-01-07 05:39:26,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:39:26,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:39:26,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231469090] [2021-01-07 05:39:26,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:39:26,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:26,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:39:26,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:39:26,006 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 9 states. [2021-01-07 05:39:26,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:26,377 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2021-01-07 05:39:26,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:39:26,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2021-01-07 05:39:26,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:26,379 INFO L225 Difference]: With dead ends: 144 [2021-01-07 05:39:26,379 INFO L226 Difference]: Without dead ends: 144 [2021-01-07 05:39:26,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:39:26,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-01-07 05:39:26,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 74. [2021-01-07 05:39:26,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2021-01-07 05:39:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2021-01-07 05:39:26,383 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 22 [2021-01-07 05:39:26,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:26,383 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2021-01-07 05:39:26,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:39:26,384 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2021-01-07 05:39:26,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:39:26,385 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:26,385 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:39:26,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 05:39:26,385 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:26,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:26,386 INFO L82 PathProgramCache]: Analyzing trace with hash -687020392, now seen corresponding path program 1 times [2021-01-07 05:39:26,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:26,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611983584] [2021-01-07 05:39:26,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:26,510 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:39:26,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611983584] [2021-01-07 05:39:26,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:39:26,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:39:26,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624132740] [2021-01-07 05:39:26,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:39:26,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:26,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:39:26,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:39:26,514 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 9 states. [2021-01-07 05:39:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:26,897 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2021-01-07 05:39:26,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:39:26,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2021-01-07 05:39:26,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:26,899 INFO L225 Difference]: With dead ends: 124 [2021-01-07 05:39:26,900 INFO L226 Difference]: Without dead ends: 124 [2021-01-07 05:39:26,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:39:26,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-01-07 05:39:26,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 74. [2021-01-07 05:39:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2021-01-07 05:39:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2021-01-07 05:39:26,904 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 22 [2021-01-07 05:39:26,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:26,904 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2021-01-07 05:39:26,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:39:26,904 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2021-01-07 05:39:26,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-07 05:39:26,905 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:26,906 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] [2021-01-07 05:39:26,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 05:39:26,906 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:26,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:26,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1197103645, now seen corresponding path program 1 times [2021-01-07 05:39:26,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:26,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849965189] [2021-01-07 05:39:26,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:26,954 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:39:26,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849965189] [2021-01-07 05:39:26,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:39:26,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:39:26,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602899554] [2021-01-07 05:39:26,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:39:26,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:26,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:39:26,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:39:26,961 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 4 states. [2021-01-07 05:39:26,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:26,990 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2021-01-07 05:39:26,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:39:26,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2021-01-07 05:39:26,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:26,991 INFO L225 Difference]: With dead ends: 102 [2021-01-07 05:39:26,991 INFO L226 Difference]: Without dead ends: 102 [2021-01-07 05:39:26,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:39:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-01-07 05:39:26,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 76. [2021-01-07 05:39:26,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2021-01-07 05:39:26,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-01-07 05:39:26,995 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 24 [2021-01-07 05:39:26,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:26,995 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-01-07 05:39:26,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:39:26,996 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-01-07 05:39:26,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-07 05:39:26,996 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:26,997 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] [2021-01-07 05:39:26,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 05:39:26,997 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:26,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:26,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1503677429, now seen corresponding path program 1 times [2021-01-07 05:39:26,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:26,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226257761] [2021-01-07 05:39:26,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:27,039 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:39:27,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226257761] [2021-01-07 05:39:27,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:39:27,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:39:27,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778502592] [2021-01-07 05:39:27,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:39:27,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:27,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:39:27,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:39:27,042 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 4 states. [2021-01-07 05:39:27,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:27,079 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2021-01-07 05:39:27,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:39:27,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2021-01-07 05:39:27,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:27,081 INFO L225 Difference]: With dead ends: 151 [2021-01-07 05:39:27,081 INFO L226 Difference]: Without dead ends: 151 [2021-01-07 05:39:27,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:39:27,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-01-07 05:39:27,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 77. [2021-01-07 05:39:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2021-01-07 05:39:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2021-01-07 05:39:27,085 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 25 [2021-01-07 05:39:27,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:27,085 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2021-01-07 05:39:27,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:39:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2021-01-07 05:39:27,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-07 05:39:27,086 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:27,086 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] [2021-01-07 05:39:27,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 05:39:27,087 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:27,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:27,088 INFO L82 PathProgramCache]: Analyzing trace with hash -863765711, now seen corresponding path program 1 times [2021-01-07 05:39:27,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:27,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256633950] [2021-01-07 05:39:27,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:27,171 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:39:27,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256633950] [2021-01-07 05:39:27,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:39:27,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:39:27,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663044839] [2021-01-07 05:39:27,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:39:27,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:27,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:39:27,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:39:27,174 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 9 states. [2021-01-07 05:39:27,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:27,511 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2021-01-07 05:39:27,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:39:27,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2021-01-07 05:39:27,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:27,516 INFO L225 Difference]: With dead ends: 107 [2021-01-07 05:39:27,517 INFO L226 Difference]: Without dead ends: 107 [2021-01-07 05:39:27,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:39:27,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-01-07 05:39:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 80. [2021-01-07 05:39:27,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2021-01-07 05:39:27,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2021-01-07 05:39:27,521 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 28 [2021-01-07 05:39:27,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:27,521 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2021-01-07 05:39:27,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:39:27,522 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2021-01-07 05:39:27,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-07 05:39:27,522 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:27,523 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] [2021-01-07 05:39:27,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 05:39:27,523 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:27,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:27,524 INFO L82 PathProgramCache]: Analyzing trace with hash -863765710, now seen corresponding path program 1 times [2021-01-07 05:39:27,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:27,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324942565] [2021-01-07 05:39:27,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:39:27,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324942565] [2021-01-07 05:39:27,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847785981] [2021-01-07 05:39:27,584 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:39:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:27,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 05:39:27,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:39:27,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:39:27,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:39:27,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-01-07 05:39:27,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849572400] [2021-01-07 05:39:27,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:39:27,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:27,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:39:27,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:39:27,836 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 8 states. [2021-01-07 05:39:27,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:27,891 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2021-01-07 05:39:27,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:39:27,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2021-01-07 05:39:27,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:27,893 INFO L225 Difference]: With dead ends: 101 [2021-01-07 05:39:27,893 INFO L226 Difference]: Without dead ends: 101 [2021-01-07 05:39:27,893 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:39:27,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-01-07 05:39:27,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2021-01-07 05:39:27,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2021-01-07 05:39:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2021-01-07 05:39:27,897 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 28 [2021-01-07 05:39:27,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:27,898 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2021-01-07 05:39:27,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:39:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2021-01-07 05:39:27,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-07 05:39:27,899 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:27,900 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:39:28,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-07 05:39:28,116 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:28,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:28,117 INFO L82 PathProgramCache]: Analyzing trace with hash -966118025, now seen corresponding path program 1 times [2021-01-07 05:39:28,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:28,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859336960] [2021-01-07 05:39:28,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:28,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:39:28,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859336960] [2021-01-07 05:39:28,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267517616] [2021-01-07 05:39:28,637 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:39:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:28,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 59 conjunts are in the unsatisfiable core [2021-01-07 05:39:28,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:39:28,845 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:39:28,847 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:28,850 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:28,851 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:39:28,851 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:39:28,925 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:28,926 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:39:28,937 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:39:28,947 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:28,956 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:28,957 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:39:28,958 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2021-01-07 05:39:29,159 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:39:29,163 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:29,176 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:29,177 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:39:29,177 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2021-01-07 05:39:29,305 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:29,305 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2021-01-07 05:39:29,312 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2021-01-07 05:39:29,313 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:39:29,314 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:29,327 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:29,330 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:39:29,330 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2021-01-07 05:39:29,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:39:29,722 INFO L348 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2021-01-07 05:39:29,722 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 48 treesize of output 52 [2021-01-07 05:39:29,726 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:29,741 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:29,746 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:39:29,746 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2021-01-07 05:39:29,916 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:29,916 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 36 treesize of output 31 [2021-01-07 05:39:29,919 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:29,931 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:29,936 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:39:29,936 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:15 [2021-01-07 05:39:30,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:39:30,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:39:30,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2021-01-07 05:39:30,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193034004] [2021-01-07 05:39:30,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-01-07 05:39:30,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:30,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-01-07 05:39:30,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=840, Unknown=0, NotChecked=0, Total=930 [2021-01-07 05:39:30,084 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand 31 states. [2021-01-07 05:39:30,998 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2021-01-07 05:39:31,303 WARN L197 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-01-07 05:39:31,594 WARN L197 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2021-01-07 05:39:31,869 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2021-01-07 05:39:32,205 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2021-01-07 05:39:32,423 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2021-01-07 05:39:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:33,250 INFO L93 Difference]: Finished difference Result 290 states and 345 transitions. [2021-01-07 05:39:33,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-07 05:39:33,251 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 29 [2021-01-07 05:39:33,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:33,255 INFO L225 Difference]: With dead ends: 290 [2021-01-07 05:39:33,255 INFO L226 Difference]: Without dead ends: 290 [2021-01-07 05:39:33,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=366, Invalid=1986, Unknown=0, NotChecked=0, Total=2352 [2021-01-07 05:39:33,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-01-07 05:39:33,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 120. [2021-01-07 05:39:33,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2021-01-07 05:39:33,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 145 transitions. [2021-01-07 05:39:33,264 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 145 transitions. Word has length 29 [2021-01-07 05:39:33,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:33,264 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 145 transitions. [2021-01-07 05:39:33,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2021-01-07 05:39:33,265 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 145 transitions. [2021-01-07 05:39:33,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-07 05:39:33,266 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:33,266 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:39:33,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 05:39:33,481 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:33,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:33,482 INFO L82 PathProgramCache]: Analyzing trace with hash -966118024, now seen corresponding path program 1 times [2021-01-07 05:39:33,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:33,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139361559] [2021-01-07 05:39:33,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:34,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:39:34,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139361559] [2021-01-07 05:39:34,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325533344] [2021-01-07 05:39:34,066 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:39:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:34,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 66 conjunts are in the unsatisfiable core [2021-01-07 05:39:34,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:39:34,171 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:39:34,172 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:34,174 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:34,175 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:39:34,175 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:39:34,395 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:34,396 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:39:34,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:39:34,404 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:34,415 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:34,420 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 14 treesize of output 16 [2021-01-07 05:39:34,422 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:34,432 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:34,434 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:39:34,435 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2021-01-07 05:39:34,649 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:39:34,650 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:34,663 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:34,667 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:39:34,668 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:34,680 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:34,682 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:39:34,682 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2021-01-07 05:39:34,856 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 42 treesize of output 33 [2021-01-07 05:39:34,859 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:34,874 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:34,900 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:34,900 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 64 [2021-01-07 05:39:34,906 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2021-01-07 05:39:34,906 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:39:34,910 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:34,923 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:34,926 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:39:34,926 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:58 [2021-01-07 05:39:35,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:39:35,354 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 53 treesize of output 36 [2021-01-07 05:39:35,356 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:35,377 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:35,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:39:35,418 INFO L348 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2021-01-07 05:39:35,419 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 65 treesize of output 65 [2021-01-07 05:39:35,423 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:35,440 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:35,444 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:39:35,445 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:99, output treesize:58 [2021-01-07 05:39:35,610 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:35,610 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 44 [2021-01-07 05:39:35,613 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:35,628 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:35,633 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2021-01-07 05:39:35,636 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:35,644 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:35,646 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:39:35,647 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:72, output treesize:20 [2021-01-07 05:39:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:39:35,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:39:35,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2021-01-07 05:39:35,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858772697] [2021-01-07 05:39:35,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-01-07 05:39:35,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:35,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-01-07 05:39:35,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1179, Unknown=0, NotChecked=0, Total=1260 [2021-01-07 05:39:35,831 INFO L87 Difference]: Start difference. First operand 120 states and 145 transitions. Second operand 36 states. [2021-01-07 05:39:36,731 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2021-01-07 05:39:36,957 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2021-01-07 05:39:37,165 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2021-01-07 05:39:37,356 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2021-01-07 05:39:37,621 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2021-01-07 05:39:37,963 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 87 [2021-01-07 05:39:38,445 WARN L197 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 109 [2021-01-07 05:39:39,002 WARN L197 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 116 [2021-01-07 05:39:39,477 WARN L197 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 94 [2021-01-07 05:39:40,032 WARN L197 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 101 [2021-01-07 05:39:40,471 WARN L197 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 92 [2021-01-07 05:39:40,805 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2021-01-07 05:39:41,142 WARN L197 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2021-01-07 05:39:41,476 WARN L197 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 88 [2021-01-07 05:39:42,030 WARN L197 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 95 [2021-01-07 05:39:42,463 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2021-01-07 05:39:43,191 WARN L197 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 82 [2021-01-07 05:39:43,626 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 69 [2021-01-07 05:39:44,027 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2021-01-07 05:39:44,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:44,086 INFO L93 Difference]: Finished difference Result 407 states and 481 transitions. [2021-01-07 05:39:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-01-07 05:39:44,095 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 29 [2021-01-07 05:39:44,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:44,098 INFO L225 Difference]: With dead ends: 407 [2021-01-07 05:39:44,098 INFO L226 Difference]: Without dead ends: 407 [2021-01-07 05:39:44,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=580, Invalid=2842, Unknown=0, NotChecked=0, Total=3422 [2021-01-07 05:39:44,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-01-07 05:39:44,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 127. [2021-01-07 05:39:44,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2021-01-07 05:39:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2021-01-07 05:39:44,107 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 29 [2021-01-07 05:39:44,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:44,107 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2021-01-07 05:39:44,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2021-01-07 05:39:44,108 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2021-01-07 05:39:44,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-07 05:39:44,108 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:44,109 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:39:44,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-07 05:39:44,322 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:44,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:44,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1930359366, now seen corresponding path program 2 times [2021-01-07 05:39:44,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:44,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759639818] [2021-01-07 05:39:44,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:39:44,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759639818] [2021-01-07 05:39:44,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160083738] [2021-01-07 05:39:44,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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:39:44,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:39:44,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:39:44,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 05:39:44,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:39:44,557 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:39:44,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:39:44,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-01-07 05:39:44,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774371100] [2021-01-07 05:39:44,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:39:44,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:44,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:39:44,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:39:44,563 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 6 states. [2021-01-07 05:39:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:44,617 INFO L93 Difference]: Finished difference Result 129 states and 148 transitions. [2021-01-07 05:39:44,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:39:44,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2021-01-07 05:39:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:44,619 INFO L225 Difference]: With dead ends: 129 [2021-01-07 05:39:44,619 INFO L226 Difference]: Without dead ends: 129 [2021-01-07 05:39:44,621 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:39:44,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-01-07 05:39:44,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2021-01-07 05:39:44,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2021-01-07 05:39:44,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2021-01-07 05:39:44,626 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 32 [2021-01-07 05:39:44,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:44,626 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2021-01-07 05:39:44,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:39:44,626 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2021-01-07 05:39:44,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-07 05:39:44,627 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:44,628 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:39:44,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:39:44,843 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:44,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:44,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1044547285, now seen corresponding path program 2 times [2021-01-07 05:39:44,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:44,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725438440] [2021-01-07 05:39:44,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:39:44,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725438440] [2021-01-07 05:39:44,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193633164] [2021-01-07 05:39:44,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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:39:45,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:39:45,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:39:45,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-07 05:39:45,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:39:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:39:45,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:39:45,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-01-07 05:39:45,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182652375] [2021-01-07 05:39:45,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:39:45,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:45,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:39:45,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:39:45,081 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand 7 states. [2021-01-07 05:39:45,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:45,165 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2021-01-07 05:39:45,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:39:45,166 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2021-01-07 05:39:45,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:45,167 INFO L225 Difference]: With dead ends: 125 [2021-01-07 05:39:45,167 INFO L226 Difference]: Without dead ends: 125 [2021-01-07 05:39:45,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-01-07 05:39:45,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-01-07 05:39:45,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2021-01-07 05:39:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2021-01-07 05:39:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 139 transitions. [2021-01-07 05:39:45,172 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 139 transitions. Word has length 32 [2021-01-07 05:39:45,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:45,172 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 139 transitions. [2021-01-07 05:39:45,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:39:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2021-01-07 05:39:45,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-07 05:39:45,173 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:45,173 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:39:45,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-07 05:39:45,388 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:45,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:45,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1906483730, now seen corresponding path program 1 times [2021-01-07 05:39:45,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:45,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24868478] [2021-01-07 05:39:45,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-07 05:39:45,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24868478] [2021-01-07 05:39:45,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:39:45,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:39:45,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077079259] [2021-01-07 05:39:45,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:39:45,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:45,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:39:45,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:39:45,579 INFO L87 Difference]: Start difference. First operand 119 states and 139 transitions. Second operand 9 states. [2021-01-07 05:39:45,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:45,982 INFO L93 Difference]: Finished difference Result 159 states and 178 transitions. [2021-01-07 05:39:45,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:39:45,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2021-01-07 05:39:45,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:45,984 INFO L225 Difference]: With dead ends: 159 [2021-01-07 05:39:45,984 INFO L226 Difference]: Without dead ends: 159 [2021-01-07 05:39:45,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:39:45,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-07 05:39:45,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 119. [2021-01-07 05:39:45,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2021-01-07 05:39:45,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2021-01-07 05:39:45,989 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 35 [2021-01-07 05:39:45,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:45,990 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2021-01-07 05:39:45,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:39:45,990 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2021-01-07 05:39:45,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 05:39:45,991 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:45,991 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:39:45,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 05:39:45,991 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:45,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:45,992 INFO L82 PathProgramCache]: Analyzing trace with hash -987731305, now seen corresponding path program 3 times [2021-01-07 05:39:45,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:45,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25146494] [2021-01-07 05:39:45,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 05:39:46,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25146494] [2021-01-07 05:39:46,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118059538] [2021-01-07 05:39:46,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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:39:46,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-01-07 05:39:46,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:39:46,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 05:39:46,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:39:46,418 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 05:39:46,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:39:46,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2021-01-07 05:39:46,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146630341] [2021-01-07 05:39:46,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:39:46,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:46,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:39:46,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:39:46,421 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 6 states. [2021-01-07 05:39:46,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:46,456 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2021-01-07 05:39:46,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:39:46,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2021-01-07 05:39:46,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:46,457 INFO L225 Difference]: With dead ends: 120 [2021-01-07 05:39:46,457 INFO L226 Difference]: Without dead ends: 120 [2021-01-07 05:39:46,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:39:46,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-01-07 05:39:46,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2021-01-07 05:39:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2021-01-07 05:39:46,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2021-01-07 05:39:46,463 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 36 [2021-01-07 05:39:46,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:46,463 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2021-01-07 05:39:46,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:39:46,463 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2021-01-07 05:39:46,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-07 05:39:46,464 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:46,464 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:39:46,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:39:46,680 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:46,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:46,682 INFO L82 PathProgramCache]: Analyzing trace with hash -543069979, now seen corresponding path program 4 times [2021-01-07 05:39:46,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:46,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739474682] [2021-01-07 05:39:46,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 05:39:46,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739474682] [2021-01-07 05:39:46,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026694129] [2021-01-07 05:39:46,774 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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:39:46,917 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-07 05:39:46,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:39:46,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 05:39:46,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:39:46,962 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 05:39:46,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:39:46,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-01-07 05:39:46,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129109233] [2021-01-07 05:39:46,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:39:46,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:46,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:39:46,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:39:46,964 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 4 states. [2021-01-07 05:39:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:46,974 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2021-01-07 05:39:46,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:39:46,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2021-01-07 05:39:46,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:46,975 INFO L225 Difference]: With dead ends: 89 [2021-01-07 05:39:46,975 INFO L226 Difference]: Without dead ends: 89 [2021-01-07 05:39:46,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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:39:46,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-01-07 05:39:46,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-01-07 05:39:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2021-01-07 05:39:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2021-01-07 05:39:46,982 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 37 [2021-01-07 05:39:46,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:46,983 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2021-01-07 05:39:46,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:39:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2021-01-07 05:39:46,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-07 05:39:46,984 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:46,984 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:39:47,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:39:47,199 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:47,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:47,200 INFO L82 PathProgramCache]: Analyzing trace with hash -589032909, now seen corresponding path program 1 times [2021-01-07 05:39:47,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:47,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456863108] [2021-01-07 05:39:47,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:47,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 05:39:47,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456863108] [2021-01-07 05:39:47,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:39:47,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:39:47,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571864934] [2021-01-07 05:39:47,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:39:47,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:47,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:39:47,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:39:47,275 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 4 states. [2021-01-07 05:39:47,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:47,304 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2021-01-07 05:39:47,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:39:47,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2021-01-07 05:39:47,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:47,306 INFO L225 Difference]: With dead ends: 86 [2021-01-07 05:39:47,306 INFO L226 Difference]: Without dead ends: 86 [2021-01-07 05:39:47,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:39:47,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-01-07 05:39:47,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2021-01-07 05:39:47,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-01-07 05:39:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2021-01-07 05:39:47,310 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 38 [2021-01-07 05:39:47,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:47,311 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2021-01-07 05:39:47,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:39:47,311 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2021-01-07 05:39:47,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-07 05:39:47,311 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:47,312 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:39:47,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-07 05:39:47,312 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:47,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:47,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1130721309, now seen corresponding path program 1 times [2021-01-07 05:39:47,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:47,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582646619] [2021-01-07 05:39:47,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:39:48,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582646619] [2021-01-07 05:39:48,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379404879] [2021-01-07 05:39:48,208 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:39:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:48,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 91 conjunts are in the unsatisfiable core [2021-01-07 05:39:48,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:39:48,363 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:39:48,364 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:48,368 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:48,369 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:39:48,369 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:39:48,497 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:48,497 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:39:48,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:39:48,502 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:48,509 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:48,510 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:39:48,511 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-01-07 05:39:48,732 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:39:48,733 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:48,743 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:48,744 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:39:48,744 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-01-07 05:39:48,891 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:48,892 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 46 [2021-01-07 05:39:48,895 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2021-01-07 05:39:48,895 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:39:48,896 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:48,907 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:48,908 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:39:48,909 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2021-01-07 05:39:49,253 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_17|], 6=[|v_#memory_$Pointer$.base_27|]} [2021-01-07 05:39:49,259 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:39:49,259 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:49,277 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:49,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:39:49,326 INFO L348 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2021-01-07 05:39:49,326 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2021-01-07 05:39:49,329 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:49,343 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:49,347 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:39:49,348 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:38 [2021-01-07 05:39:49,581 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:49,582 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 27 treesize of output 26 [2021-01-07 05:39:49,583 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:49,594 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:49,595 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:39:49,595 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:23 [2021-01-07 05:39:49,765 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-07 05:39:49,767 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:49,779 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:49,783 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:39:49,784 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2021-01-07 05:39:50,026 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 28 treesize of output 10 [2021-01-07 05:39:50,030 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:50,036 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:50,040 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:39:50,040 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2021-01-07 05:39:50,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:39:50,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:39:50,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2021-01-07 05:39:50,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161249547] [2021-01-07 05:39:50,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-01-07 05:39:50,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:50,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-01-07 05:39:50,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2208, Unknown=0, NotChecked=0, Total=2352 [2021-01-07 05:39:50,239 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 49 states. [2021-01-07 05:39:51,512 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2021-01-07 05:39:51,749 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-01-07 05:39:52,012 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2021-01-07 05:39:52,272 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2021-01-07 05:39:53,434 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2021-01-07 05:39:53,600 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2021-01-07 05:39:53,774 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2021-01-07 05:39:54,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:54,416 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2021-01-07 05:39:54,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-01-07 05:39:54,419 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 39 [2021-01-07 05:39:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:54,421 INFO L225 Difference]: With dead ends: 104 [2021-01-07 05:39:54,422 INFO L226 Difference]: Without dead ends: 104 [2021-01-07 05:39:54,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=636, Invalid=4766, Unknown=0, NotChecked=0, Total=5402 [2021-01-07 05:39:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-01-07 05:39:54,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2021-01-07 05:39:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-01-07 05:39:54,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2021-01-07 05:39:54,427 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 39 [2021-01-07 05:39:54,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:54,427 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2021-01-07 05:39:54,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2021-01-07 05:39:54,427 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2021-01-07 05:39:54,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-07 05:39:54,428 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:54,428 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:39:54,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-01-07 05:39:54,636 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:54,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:54,637 INFO L82 PathProgramCache]: Analyzing trace with hash 351620779, now seen corresponding path program 1 times [2021-01-07 05:39:54,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:54,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807281585] [2021-01-07 05:39:54,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:39:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:55,173 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:39:55,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807281585] [2021-01-07 05:39:55,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147162686] [2021-01-07 05:39:55,173 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:39:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:39:55,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 65 conjunts are in the unsatisfiable core [2021-01-07 05:39:55,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:39:55,299 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:39:55,300 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:55,302 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:55,302 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:39:55,302 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:39:55,339 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:55,339 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:39:55,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:39:55,343 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:55,353 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:55,353 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:39:55,354 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2021-01-07 05:39:55,508 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:39:55,509 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:55,517 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:55,518 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:39:55,518 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2021-01-07 05:39:55,640 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:55,640 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2021-01-07 05:39:55,643 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2021-01-07 05:39:55,643 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:39:55,646 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:55,655 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:55,656 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:39:55,657 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2021-01-07 05:39:55,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:39:56,032 INFO L348 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2021-01-07 05:39:56,032 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 48 treesize of output 52 [2021-01-07 05:39:56,035 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:56,047 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:56,050 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:39:56,050 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:34 [2021-01-07 05:39:56,370 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:56,371 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 117 [2021-01-07 05:39:56,374 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2021-01-07 05:39:56,374 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:39:56,376 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:56,402 INFO L625 ElimStorePlain]: treesize reduction 28, result has 58.8 percent of original size [2021-01-07 05:39:56,405 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:39:56,405 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:23 [2021-01-07 05:39:56,554 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 25 treesize of output 13 [2021-01-07 05:39:56,557 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:39:56,564 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:39:56,566 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:39:56,566 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:15 [2021-01-07 05:39:56,732 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:39:56,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:39:56,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 37 [2021-01-07 05:39:56,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716470873] [2021-01-07 05:39:56,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-01-07 05:39:56,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:39:56,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-01-07 05:39:56,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1287, Unknown=0, NotChecked=0, Total=1406 [2021-01-07 05:39:56,734 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 38 states. [2021-01-07 05:39:57,836 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2021-01-07 05:39:58,074 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2021-01-07 05:39:58,319 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2021-01-07 05:39:58,558 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2021-01-07 05:39:58,801 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2021-01-07 05:39:59,015 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2021-01-07 05:39:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:39:59,768 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2021-01-07 05:39:59,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-07 05:39:59,769 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 45 [2021-01-07 05:39:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:39:59,770 INFO L225 Difference]: With dead ends: 143 [2021-01-07 05:39:59,771 INFO L226 Difference]: Without dead ends: 143 [2021-01-07 05:39:59,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=388, Invalid=2692, Unknown=0, NotChecked=0, Total=3080 [2021-01-07 05:39:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-01-07 05:39:59,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 88. [2021-01-07 05:39:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2021-01-07 05:39:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2021-01-07 05:39:59,777 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 45 [2021-01-07 05:39:59,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:39:59,777 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2021-01-07 05:39:59,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2021-01-07 05:39:59,777 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2021-01-07 05:39:59,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-07 05:39:59,778 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:39:59,778 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:39:59,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:39:59,992 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:39:59,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:39:59,993 INFO L82 PathProgramCache]: Analyzing trace with hash 351620780, now seen corresponding path program 1 times [2021-01-07 05:39:59,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:39:59,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181453211] [2021-01-07 05:39:59,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:40:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:40:00,795 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:40:00,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181453211] [2021-01-07 05:40:00,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602796544] [2021-01-07 05:40:00,796 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:40:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:40:00,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 80 conjunts are in the unsatisfiable core [2021-01-07 05:40:00,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:40:00,935 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:40:00,940 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:00,942 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:00,942 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:40:00,943 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:40:01,207 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:01,208 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:40:01,210 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:40:01,213 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:01,223 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:01,228 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 14 treesize of output 16 [2021-01-07 05:40:01,231 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:01,243 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:01,244 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:40:01,244 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2021-01-07 05:40:01,455 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:40:01,456 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:01,473 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:01,478 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:40:01,479 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:01,495 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:01,496 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:40:01,497 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2021-01-07 05:40:01,678 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:01,679 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 68 [2021-01-07 05:40:01,682 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2021-01-07 05:40:01,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:40:01,683 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:01,707 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:01,711 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 42 treesize of output 33 [2021-01-07 05:40:01,713 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:01,726 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:01,728 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:40:01,728 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:58 [2021-01-07 05:40:02,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:40:02,182 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 53 treesize of output 36 [2021-01-07 05:40:02,184 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:02,210 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:02,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:40:02,259 INFO L348 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2021-01-07 05:40:02,259 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 65 treesize of output 65 [2021-01-07 05:40:02,262 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:02,280 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:02,282 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:40:02,282 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:99, output treesize:58 [2021-01-07 05:40:02,695 INFO L348 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2021-01-07 05:40:02,696 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 42 [2021-01-07 05:40:02,699 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:02,726 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:02,773 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:02,773 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 136 [2021-01-07 05:40:02,777 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2021-01-07 05:40:02,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:40:02,779 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:02,827 INFO L625 ElimStorePlain]: treesize reduction 28, result has 71.4 percent of original size [2021-01-07 05:40:02,828 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-07 05:40:02,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:40:02,831 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:40:02,832 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:120, output treesize:36 [2021-01-07 05:40:03,029 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 31 treesize of output 19 [2021-01-07 05:40:03,035 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:03,046 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:03,050 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 26 treesize of output 14 [2021-01-07 05:40:03,051 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:03,061 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:03,062 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:40:03,063 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:20 [2021-01-07 05:40:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:40:03,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:40:03,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2021-01-07 05:40:03,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468023778] [2021-01-07 05:40:03,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-01-07 05:40:03,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:40:03,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-01-07 05:40:03,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2021-01-07 05:40:03,307 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 44 states. [2021-01-07 05:40:04,334 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2021-01-07 05:40:04,576 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2021-01-07 05:40:04,870 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2021-01-07 05:40:05,239 WARN L197 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2021-01-07 05:40:05,735 WARN L197 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 114 [2021-01-07 05:40:06,339 WARN L197 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 121 [2021-01-07 05:40:06,808 WARN L197 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 100 [2021-01-07 05:40:07,314 WARN L197 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 102 [2021-01-07 05:40:07,721 WARN L197 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2021-01-07 05:40:08,105 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2021-01-07 05:40:08,395 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2021-01-07 05:40:09,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:40:09,519 INFO L93 Difference]: Finished difference Result 215 states and 221 transitions. [2021-01-07 05:40:09,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-07 05:40:09,520 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 45 [2021-01-07 05:40:09,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:40:09,521 INFO L225 Difference]: With dead ends: 215 [2021-01-07 05:40:09,521 INFO L226 Difference]: Without dead ends: 215 [2021-01-07 05:40:09,523 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=520, Invalid=3640, Unknown=0, NotChecked=0, Total=4160 [2021-01-07 05:40:09,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-01-07 05:40:09,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 87. [2021-01-07 05:40:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2021-01-07 05:40:09,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2021-01-07 05:40:09,528 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 45 [2021-01-07 05:40:09,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:40:09,528 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2021-01-07 05:40:09,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2021-01-07 05:40:09,528 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2021-01-07 05:40:09,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-07 05:40:09,529 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:40:09,529 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:40:09,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:40:09,740 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:40:09,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:40:09,741 INFO L82 PathProgramCache]: Analyzing trace with hash -2035228053, now seen corresponding path program 1 times [2021-01-07 05:40:09,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:40:09,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249894627] [2021-01-07 05:40:09,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:40:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:40:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 05:40:09,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249894627] [2021-01-07 05:40:09,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443519633] [2021-01-07 05:40:09,794 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:40:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:40:09,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 05:40:09,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:40:09,969 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 05:40:09,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:40:09,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-01-07 05:40:09,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069208855] [2021-01-07 05:40:09,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:40:09,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:40:09,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:40:09,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:40:09,971 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 6 states. [2021-01-07 05:40:10,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:40:10,031 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2021-01-07 05:40:10,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:40:10,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2021-01-07 05:40:10,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:40:10,032 INFO L225 Difference]: With dead ends: 87 [2021-01-07 05:40:10,033 INFO L226 Difference]: Without dead ends: 87 [2021-01-07 05:40:10,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:40:10,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-01-07 05:40:10,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-01-07 05:40:10,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2021-01-07 05:40:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2021-01-07 05:40:10,035 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 46 [2021-01-07 05:40:10,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:40:10,036 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2021-01-07 05:40:10,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:40:10,036 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2021-01-07 05:40:10,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-07 05:40:10,036 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:40:10,036 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:40:10,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-01-07 05:40:10,249 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:40:10,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:40:10,251 INFO L82 PathProgramCache]: Analyzing trace with hash -288888999, now seen corresponding path program 2 times [2021-01-07 05:40:10,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:40:10,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614634614] [2021-01-07 05:40:10,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:40:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:40:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 05:40:10,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614634614] [2021-01-07 05:40:10,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158399187] [2021-01-07 05:40:10,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:40:10,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:40:10,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:40:10,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-07 05:40:10,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:40:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-07 05:40:10,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:40:10,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-01-07 05:40:10,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827147413] [2021-01-07 05:40:10,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:40:10,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:40:10,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:40:10,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:40:10,517 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 7 states. [2021-01-07 05:40:10,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:40:10,630 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2021-01-07 05:40:10,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:40:10,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2021-01-07 05:40:10,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:40:10,631 INFO L225 Difference]: With dead ends: 78 [2021-01-07 05:40:10,631 INFO L226 Difference]: Without dead ends: 78 [2021-01-07 05:40:10,631 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:40:10,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-01-07 05:40:10,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-01-07 05:40:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2021-01-07 05:40:10,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2021-01-07 05:40:10,634 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 48 [2021-01-07 05:40:10,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:40:10,635 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2021-01-07 05:40:10,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:40:10,635 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2021-01-07 05:40:10,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-07 05:40:10,635 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:40:10,636 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:40:10,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-01-07 05:40:10,850 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:40:10,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:40:10,851 INFO L82 PathProgramCache]: Analyzing trace with hash -416194691, now seen corresponding path program 1 times [2021-01-07 05:40:10,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:40:10,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52699551] [2021-01-07 05:40:10,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:40:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:40:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:40:11,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52699551] [2021-01-07 05:40:11,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998755386] [2021-01-07 05:40:11,847 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:40:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:40:11,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 95 conjunts are in the unsatisfiable core [2021-01-07 05:40:11,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:40:12,157 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:12,157 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:40:12,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:40:12,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:40:12,165 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:12,170 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:12,171 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:40:12,171 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2021-01-07 05:40:12,356 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:40:12,358 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:12,364 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:12,364 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:40:12,365 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2021-01-07 05:40:12,535 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:12,536 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 46 [2021-01-07 05:40:12,538 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2021-01-07 05:40:12,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:40:12,542 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:12,548 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:12,549 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:40:12,549 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2021-01-07 05:40:12,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:40:12,972 INFO L348 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2021-01-07 05:40:12,972 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 39 treesize of output 47 [2021-01-07 05:40:12,981 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:12,990 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:12,992 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:40:12,992 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:23 [2021-01-07 05:40:13,476 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_19|], 2=[|v_#memory_$Pointer$.offset_26|], 6=[|v_#memory_$Pointer$.base_39|]} [2021-01-07 05:40:13,482 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 27 treesize of output 19 [2021-01-07 05:40:13,483 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:13,499 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:13,503 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 98 treesize of output 80 [2021-01-07 05:40:13,505 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:13,516 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:13,560 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:13,561 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 159 [2021-01-07 05:40:13,565 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2021-01-07 05:40:13,565 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:40:13,567 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:13,590 INFO L625 ElimStorePlain]: treesize reduction 36, result has 57.6 percent of original size [2021-01-07 05:40:13,593 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:40:13,593 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:125, output treesize:28 [2021-01-07 05:40:14,043 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 33 treesize of output 21 [2021-01-07 05:40:14,044 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:14,051 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:14,054 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 13 [2021-01-07 05:40:14,056 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:14,060 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:14,062 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:40:14,062 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:9 [2021-01-07 05:40:14,226 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-01-07 05:40:14,227 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:14,229 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:14,230 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:40:14,230 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2021-01-07 05:40:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:40:14,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:40:14,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 50 [2021-01-07 05:40:14,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620706315] [2021-01-07 05:40:14,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-01-07 05:40:14,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:40:14,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-01-07 05:40:14,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2341, Unknown=0, NotChecked=0, Total=2450 [2021-01-07 05:40:14,359 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 50 states. [2021-01-07 05:40:16,054 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2021-01-07 05:40:16,341 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2021-01-07 05:40:16,656 WARN L197 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2021-01-07 05:40:16,951 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2021-01-07 05:40:17,202 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2021-01-07 05:40:17,511 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2021-01-07 05:40:17,849 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2021-01-07 05:40:18,165 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2021-01-07 05:40:18,542 WARN L197 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 80 [2021-01-07 05:40:18,864 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2021-01-07 05:40:19,206 WARN L197 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2021-01-07 05:40:19,646 WARN L197 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2021-01-07 05:40:20,040 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2021-01-07 05:40:20,478 WARN L197 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 100 [2021-01-07 05:40:20,874 WARN L197 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2021-01-07 05:40:21,302 WARN L197 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2021-01-07 05:40:21,734 WARN L197 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2021-01-07 05:40:22,189 WARN L197 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2021-01-07 05:40:22,645 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2021-01-07 05:40:23,274 WARN L197 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2021-01-07 05:40:23,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:40:23,374 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2021-01-07 05:40:23,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-01-07 05:40:23,376 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2021-01-07 05:40:23,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:40:23,377 INFO L225 Difference]: With dead ends: 96 [2021-01-07 05:40:23,377 INFO L226 Difference]: Without dead ends: 96 [2021-01-07 05:40:23,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=755, Invalid=5251, Unknown=0, NotChecked=0, Total=6006 [2021-01-07 05:40:23,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-01-07 05:40:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 76. [2021-01-07 05:40:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2021-01-07 05:40:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2021-01-07 05:40:23,382 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 49 [2021-01-07 05:40:23,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:40:23,383 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2021-01-07 05:40:23,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2021-01-07 05:40:23,383 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2021-01-07 05:40:23,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-07 05:40:23,384 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:40:23,384 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:40:23,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-01-07 05:40:23,599 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:40:23,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:40:23,599 INFO L82 PathProgramCache]: Analyzing trace with hash 694716595, now seen corresponding path program 1 times [2021-01-07 05:40:23,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:40:23,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294202314] [2021-01-07 05:40:23,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:40:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:40:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-07 05:40:23,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294202314] [2021-01-07 05:40:23,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:40:23,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:40:23,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97521778] [2021-01-07 05:40:23,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:40:23,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:40:23,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:40:23,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:40:23,697 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 9 states. [2021-01-07 05:40:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:40:23,987 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2021-01-07 05:40:23,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:40:23,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2021-01-07 05:40:23,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:40:23,988 INFO L225 Difference]: With dead ends: 94 [2021-01-07 05:40:23,988 INFO L226 Difference]: Without dead ends: 94 [2021-01-07 05:40:23,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:40:23,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-01-07 05:40:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 79. [2021-01-07 05:40:23,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2021-01-07 05:40:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2021-01-07 05:40:23,992 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 53 [2021-01-07 05:40:23,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:40:23,993 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2021-01-07 05:40:23,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:40:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2021-01-07 05:40:23,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-07 05:40:23,993 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:40:23,994 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:40:23,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-07 05:40:23,994 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:40:23,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:40:23,995 INFO L82 PathProgramCache]: Analyzing trace with hash 694716596, now seen corresponding path program 1 times [2021-01-07 05:40:23,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:40:23,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110578952] [2021-01-07 05:40:23,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:40:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:40:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-07 05:40:24,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110578952] [2021-01-07 05:40:24,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:40:24,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:40:24,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293535471] [2021-01-07 05:40:24,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:40:24,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:40:24,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:40:24,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:40:24,136 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 9 states. [2021-01-07 05:40:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:40:24,480 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2021-01-07 05:40:24,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:40:24,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2021-01-07 05:40:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:40:24,483 INFO L225 Difference]: With dead ends: 77 [2021-01-07 05:40:24,483 INFO L226 Difference]: Without dead ends: 77 [2021-01-07 05:40:24,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:40:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-01-07 05:40:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-01-07 05:40:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2021-01-07 05:40:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2021-01-07 05:40:24,487 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 53 [2021-01-07 05:40:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:40:24,487 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2021-01-07 05:40:24,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:40:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2021-01-07 05:40:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-07 05:40:24,488 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:40:24,488 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:40:24,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-07 05:40:24,488 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:40:24,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:40:24,489 INFO L82 PathProgramCache]: Analyzing trace with hash 61411868, now seen corresponding path program 1 times [2021-01-07 05:40:24,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:40:24,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397822673] [2021-01-07 05:40:24,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:40:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:40:24,644 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-07 05:40:24,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397822673] [2021-01-07 05:40:24,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:40:24,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-07 05:40:24,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248954273] [2021-01-07 05:40:24,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:40:24,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:40:24,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:40:24,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:40:24,646 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 10 states. [2021-01-07 05:40:24,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:40:24,905 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2021-01-07 05:40:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:40:24,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2021-01-07 05:40:24,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:40:24,906 INFO L225 Difference]: With dead ends: 77 [2021-01-07 05:40:24,906 INFO L226 Difference]: Without dead ends: 77 [2021-01-07 05:40:24,908 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2021-01-07 05:40:24,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-01-07 05:40:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-01-07 05:40:24,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2021-01-07 05:40:24,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2021-01-07 05:40:24,913 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 54 [2021-01-07 05:40:24,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:40:24,914 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2021-01-07 05:40:24,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:40:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2021-01-07 05:40:24,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-07 05:40:24,915 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:40:24,915 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:40:24,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-07 05:40:24,916 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:40:24,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:40:24,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1145210246, now seen corresponding path program 1 times [2021-01-07 05:40:24,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:40:24,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615991547] [2021-01-07 05:40:24,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:40:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:40:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-07 05:40:25,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615991547] [2021-01-07 05:40:25,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023616115] [2021-01-07 05:40:25,060 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:40:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:40:25,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 70 conjunts are in the unsatisfiable core [2021-01-07 05:40:25,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:40:25,251 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:40:25,252 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:25,256 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:25,257 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:40:25,257 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:40:25,360 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:25,361 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:40:25,363 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:40:25,365 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:25,377 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:25,378 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:40:25,378 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2021-01-07 05:40:25,530 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:40:25,531 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:25,542 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:25,543 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:40:25,544 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2021-01-07 05:40:25,652 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:25,652 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2021-01-07 05:40:25,655 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2021-01-07 05:40:25,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:40:25,656 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:25,668 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:25,669 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:40:25,670 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2021-01-07 05:40:25,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:40:25,965 INFO L348 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2021-01-07 05:40:25,966 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 48 treesize of output 52 [2021-01-07 05:40:25,968 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:25,983 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:25,986 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:40:25,986 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:37 [2021-01-07 05:40:26,258 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:26,259 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 117 [2021-01-07 05:40:26,264 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2021-01-07 05:40:26,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:40:26,268 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:26,303 INFO L625 ElimStorePlain]: treesize reduction 28, result has 60.6 percent of original size [2021-01-07 05:40:26,305 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:40:26,305 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:26 [2021-01-07 05:40:26,445 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 25 treesize of output 13 [2021-01-07 05:40:26,447 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:26,457 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:26,459 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:40:26,459 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:15 [2021-01-07 05:40:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 05:40:26,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:40:26,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 20] total 27 [2021-01-07 05:40:26,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988068575] [2021-01-07 05:40:26,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-01-07 05:40:26,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:40:26,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-01-07 05:40:26,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2021-01-07 05:40:26,608 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 28 states. [2021-01-07 05:40:27,382 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2021-01-07 05:40:27,600 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2021-01-07 05:40:27,819 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-01-07 05:40:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:40:28,870 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2021-01-07 05:40:28,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-01-07 05:40:28,873 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2021-01-07 05:40:28,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:40:28,874 INFO L225 Difference]: With dead ends: 88 [2021-01-07 05:40:28,874 INFO L226 Difference]: Without dead ends: 88 [2021-01-07 05:40:28,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=307, Invalid=2143, Unknown=0, NotChecked=0, Total=2450 [2021-01-07 05:40:28,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-01-07 05:40:28,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 77. [2021-01-07 05:40:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2021-01-07 05:40:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2021-01-07 05:40:28,878 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 56 [2021-01-07 05:40:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:40:28,878 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2021-01-07 05:40:28,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2021-01-07 05:40:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2021-01-07 05:40:28,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-07 05:40:28,879 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:40:28,880 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:40:29,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:40:29,085 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:40:29,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:40:29,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1145210245, now seen corresponding path program 1 times [2021-01-07 05:40:29,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:40:29,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230984440] [2021-01-07 05:40:29,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:40:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:40:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:40:30,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230984440] [2021-01-07 05:40:30,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663783148] [2021-01-07 05:40:30,208 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:40:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:40:30,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 83 conjunts are in the unsatisfiable core [2021-01-07 05:40:30,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:40:30,378 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:40:30,379 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:30,381 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:30,381 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:40:30,382 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:40:30,547 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:30,547 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:40:30,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:40:30,550 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:30,560 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:30,561 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:40:30,561 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-01-07 05:40:30,767 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:40:30,768 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:30,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:30,788 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:40:30,789 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:30,803 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:30,804 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:40:30,805 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2021-01-07 05:40:30,971 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-01-07 05:40:30,973 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:30,988 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:31,015 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:31,015 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 53 [2021-01-07 05:40:31,018 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2021-01-07 05:40:31,018 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:40:31,020 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:31,034 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:31,037 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:40:31,037 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:44 [2021-01-07 05:40:31,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:40:31,571 INFO L348 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2021-01-07 05:40:31,572 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 50 treesize of output 54 [2021-01-07 05:40:31,574 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:31,599 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:31,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:40:31,606 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 38 treesize of output 25 [2021-01-07 05:40:31,608 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:31,625 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:31,627 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:40:31,628 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:44 [2021-01-07 05:40:32,106 INFO L348 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2021-01-07 05:40:32,106 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 34 [2021-01-07 05:40:32,108 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:32,183 INFO L625 ElimStorePlain]: treesize reduction 6, result has 93.9 percent of original size [2021-01-07 05:40:32,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:40:32,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:40:32,203 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:32,204 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2021-01-07 05:40:32,212 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:32,231 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:32,233 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:40:32,233 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:124, output treesize:59 [2021-01-07 05:40:32,659 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:32,660 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 44 [2021-01-07 05:40:32,662 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:32,684 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:32,688 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2021-01-07 05:40:32,690 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:32,705 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:32,708 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:40:32,709 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:11 [2021-01-07 05:40:32,927 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 05:40:32,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:40:32,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 45 [2021-01-07 05:40:32,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134656777] [2021-01-07 05:40:32,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-01-07 05:40:32,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:40:32,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-01-07 05:40:32,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1947, Unknown=0, NotChecked=0, Total=2070 [2021-01-07 05:40:32,931 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 46 states. [2021-01-07 05:40:33,944 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2021-01-07 05:40:34,157 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2021-01-07 05:40:34,388 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2021-01-07 05:40:34,669 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2021-01-07 05:40:35,012 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2021-01-07 05:40:35,488 WARN L197 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 109 [2021-01-07 05:40:36,054 WARN L197 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 115 [2021-01-07 05:40:36,764 WARN L197 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 119 [2021-01-07 05:40:37,283 WARN L197 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 113 [2021-01-07 05:40:37,914 WARN L197 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 119 [2021-01-07 05:40:38,557 WARN L197 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 119 [2021-01-07 05:40:39,102 WARN L197 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 115 [2021-01-07 05:40:39,785 WARN L197 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 136 [2021-01-07 05:40:40,507 WARN L197 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 141 [2021-01-07 05:40:41,207 WARN L197 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 141 [2021-01-07 05:40:42,026 WARN L197 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 130 [2021-01-07 05:40:42,720 WARN L197 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 125 [2021-01-07 05:40:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:40:42,871 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2021-01-07 05:40:42,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-07 05:40:42,872 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 56 [2021-01-07 05:40:42,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:40:42,873 INFO L225 Difference]: With dead ends: 86 [2021-01-07 05:40:42,873 INFO L226 Difference]: Without dead ends: 86 [2021-01-07 05:40:42,874 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=616, Invalid=3806, Unknown=0, NotChecked=0, Total=4422 [2021-01-07 05:40:42,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-01-07 05:40:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2021-01-07 05:40:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2021-01-07 05:40:42,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2021-01-07 05:40:42,878 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 56 [2021-01-07 05:40:42,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:40:42,878 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2021-01-07 05:40:42,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2021-01-07 05:40:42,878 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2021-01-07 05:40:42,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-07 05:40:42,879 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:40:42,879 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:40:43,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-01-07 05:40:43,094 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:40:43,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:40:43,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1141780614, now seen corresponding path program 1 times [2021-01-07 05:40:43,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:40:43,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213408047] [2021-01-07 05:40:43,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:40:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:40:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-07 05:40:43,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213408047] [2021-01-07 05:40:43,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:40:43,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:40:43,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681449991] [2021-01-07 05:40:43,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:40:43,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:40:43,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:40:43,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:40:43,203 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 9 states. [2021-01-07 05:40:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:40:43,464 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2021-01-07 05:40:43,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:40:43,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2021-01-07 05:40:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:40:43,465 INFO L225 Difference]: With dead ends: 78 [2021-01-07 05:40:43,466 INFO L226 Difference]: Without dead ends: 78 [2021-01-07 05:40:43,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:40:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-01-07 05:40:43,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-01-07 05:40:43,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2021-01-07 05:40:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2021-01-07 05:40:43,471 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 57 [2021-01-07 05:40:43,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:40:43,472 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2021-01-07 05:40:43,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:40:43,472 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2021-01-07 05:40:43,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-07 05:40:43,473 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:40:43,473 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:40:43,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-07 05:40:43,473 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:40:43,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:40:43,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2033086241, now seen corresponding path program 1 times [2021-01-07 05:40:43,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:40:43,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783805996] [2021-01-07 05:40:43,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:40:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:40:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 05:40:44,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783805996] [2021-01-07 05:40:44,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55583793] [2021-01-07 05:40:44,240 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:40:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:40:44,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 71 conjunts are in the unsatisfiable core [2021-01-07 05:40:44,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:40:44,388 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:40:44,389 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:44,393 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:44,394 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:40:44,394 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:40:44,426 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:44,427 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:40:44,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:40:44,431 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:44,438 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:44,439 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:40:44,440 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2021-01-07 05:40:44,621 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:40:44,622 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:44,632 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:44,633 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:40:44,634 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-01-07 05:40:44,782 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:44,782 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2021-01-07 05:40:44,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2021-01-07 05:40:44,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:40:44,787 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:44,797 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:44,799 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:40:44,799 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2021-01-07 05:40:45,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:40:45,196 INFO L348 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2021-01-07 05:40:45,196 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 52 [2021-01-07 05:40:45,199 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:45,213 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:45,215 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:40:45,216 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:32 [2021-01-07 05:40:45,595 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:45,595 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 117 [2021-01-07 05:40:45,598 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2021-01-07 05:40:45,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:40:45,600 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:45,635 INFO L625 ElimStorePlain]: treesize reduction 28, result has 57.6 percent of original size [2021-01-07 05:40:45,637 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:40:45,638 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:63, output treesize:21 [2021-01-07 05:40:45,825 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 25 treesize of output 13 [2021-01-07 05:40:45,828 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:40:45,852 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:45,856 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:40:45,856 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:5 [2021-01-07 05:40:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 05:40:45,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:40:45,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 38 [2021-01-07 05:40:45,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241050266] [2021-01-07 05:40:45,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-01-07 05:40:45,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:40:45,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-01-07 05:40:45,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1361, Unknown=0, NotChecked=0, Total=1482 [2021-01-07 05:40:45,957 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 39 states. [2021-01-07 05:40:47,003 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2021-01-07 05:40:47,216 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2021-01-07 05:40:47,483 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2021-01-07 05:40:47,777 WARN L197 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2021-01-07 05:40:48,054 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2021-01-07 05:40:48,341 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2021-01-07 05:40:48,592 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2021-01-07 05:40:49,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:40:49,818 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2021-01-07 05:40:49,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-01-07 05:40:49,819 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 59 [2021-01-07 05:40:49,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:40:49,820 INFO L225 Difference]: With dead ends: 83 [2021-01-07 05:40:49,820 INFO L226 Difference]: Without dead ends: 83 [2021-01-07 05:40:49,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=462, Invalid=3198, Unknown=0, NotChecked=0, Total=3660 [2021-01-07 05:40:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-01-07 05:40:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2021-01-07 05:40:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2021-01-07 05:40:49,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2021-01-07 05:40:49,826 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 59 [2021-01-07 05:40:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:40:49,827 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2021-01-07 05:40:49,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2021-01-07 05:40:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2021-01-07 05:40:49,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-07 05:40:49,827 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:40:49,828 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:40:50,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:40:50,036 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:40:50,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:40:50,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1354907408, now seen corresponding path program 1 times [2021-01-07 05:40:50,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:40:50,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372712856] [2021-01-07 05:40:50,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:40:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:40:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-07 05:40:50,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372712856] [2021-01-07 05:40:50,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217678448] [2021-01-07 05:40:50,601 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:40:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:40:50,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 76 conjunts are in the unsatisfiable core [2021-01-07 05:40:50,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:40:51,167 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:40:51,168 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:51,185 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:51,186 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:40:51,186 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2021-01-07 05:40:51,369 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:51,369 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 64 [2021-01-07 05:40:51,371 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2021-01-07 05:40:51,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:40:51,373 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:51,389 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:51,390 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:40:51,391 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:52 [2021-01-07 05:40:51,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:40:51,875 INFO L348 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2021-01-07 05:40:51,875 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 65 treesize of output 65 [2021-01-07 05:40:51,878 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:51,922 INFO L625 ElimStorePlain]: treesize reduction 14, result has 79.7 percent of original size [2021-01-07 05:40:51,924 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:40:51,924 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:52 [2021-01-07 05:40:52,340 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:52,340 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 130 [2021-01-07 05:40:52,343 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2021-01-07 05:40:52,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:40:52,347 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:40:52,399 INFO L625 ElimStorePlain]: treesize reduction 60, result has 49.2 percent of original size [2021-01-07 05:40:52,403 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:40:52,403 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:41 [2021-01-07 05:40:52,717 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:52,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2021-01-07 05:40:52,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:40:52,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:40:52,722 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:40:52,746 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:40:52,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:40:52,751 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:40:52,752 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:40:52,752 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:36 [2021-01-07 05:40:52,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:40:52,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:40:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 05:40:53,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:40:53,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2021-01-07 05:40:53,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444699112] [2021-01-07 05:40:53,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-01-07 05:40:53,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:40:53,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-01-07 05:40:53,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2021-01-07 05:40:53,160 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 43 states. [2021-01-07 05:40:54,089 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2021-01-07 05:40:54,696 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2021-01-07 05:40:55,039 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2021-01-07 05:40:55,469 WARN L197 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 64 [2021-01-07 05:40:56,035 WARN L197 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 65 [2021-01-07 05:40:56,432 WARN L197 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 64 [2021-01-07 05:40:59,155 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2021-01-07 05:40:59,455 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2021-01-07 05:40:59,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:40:59,902 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2021-01-07 05:40:59,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-07 05:40:59,903 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 60 [2021-01-07 05:40:59,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:40:59,904 INFO L225 Difference]: With dead ends: 77 [2021-01-07 05:40:59,904 INFO L226 Difference]: Without dead ends: 77 [2021-01-07 05:40:59,906 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=382, Invalid=3278, Unknown=0, NotChecked=0, Total=3660 [2021-01-07 05:40:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-01-07 05:40:59,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2021-01-07 05:40:59,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2021-01-07 05:40:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2021-01-07 05:40:59,908 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 60 [2021-01-07 05:40:59,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:40:59,908 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2021-01-07 05:40:59,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2021-01-07 05:40:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2021-01-07 05:40:59,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-07 05:40:59,909 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:40:59,909 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:00,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-01-07 05:41:00,125 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:41:00,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:41:00,126 INFO L82 PathProgramCache]: Analyzing trace with hash -43212065, now seen corresponding path program 1 times [2021-01-07 05:41:00,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:41:00,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171870440] [2021-01-07 05:41:00,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:41:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 05:41:01,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171870440] [2021-01-07 05:41:01,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295841239] [2021-01-07 05:41:01,294 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:41:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:01,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 97 conjunts are in the unsatisfiable core [2021-01-07 05:41:01,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:41:01,741 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:01,741 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:41:01,743 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:41:01,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:41:01,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:41:01,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:41:01,750 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:01,771 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:01,772 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:41:01,772 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2021-01-07 05:41:02,052 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:41:02,054 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:02,075 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:02,081 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:41:02,082 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:02,102 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:02,106 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:41:02,107 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2021-01-07 05:41:02,319 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 61 treesize of output 47 [2021-01-07 05:41:02,321 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:02,342 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:02,370 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:02,371 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 74 [2021-01-07 05:41:02,373 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2021-01-07 05:41:02,373 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:41:02,374 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:02,395 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:02,396 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:41:02,396 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:70 [2021-01-07 05:41:02,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:41:02,904 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 42 [2021-01-07 05:41:02,908 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:02,946 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:02,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:41:03,010 INFO L348 Elim1Store]: treesize reduction 32, result has 56.8 percent of original size [2021-01-07 05:41:03,010 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 75 [2021-01-07 05:41:03,013 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:03,041 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:03,043 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:41:03,043 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:70 [2021-01-07 05:41:03,515 INFO L348 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2021-01-07 05:41:03,516 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 1 case distinctions, treesize of input 83 treesize of output 51 [2021-01-07 05:41:03,518 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:03,566 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:03,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:41:03,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:41:03,586 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:03,587 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 76 [2021-01-07 05:41:03,589 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:03,616 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:03,618 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:41:03,619 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:139, output treesize:70 [2021-01-07 05:41:03,816 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 27 [2021-01-07 05:41:03,819 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:03,848 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:03,852 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:41:03,852 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:87, output treesize:53 [2021-01-07 05:41:04,152 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:41:04,173 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:04,174 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 46 [2021-01-07 05:41:04,179 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:04,201 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:04,205 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:41:04,205 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:21 [2021-01-07 05:41:04,537 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-01-07 05:41:04,539 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:04,550 INFO L625 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-01-07 05:41:04,554 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:41:04,554 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-01-07 05:41:04,704 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-07 05:41:04,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:41:04,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 50 [2021-01-07 05:41:04,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496425005] [2021-01-07 05:41:04,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-01-07 05:41:04,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:41:04,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-01-07 05:41:04,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2309, Unknown=0, NotChecked=0, Total=2450 [2021-01-07 05:41:04,707 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 50 states. [2021-01-07 05:41:05,920 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2021-01-07 05:41:06,170 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2021-01-07 05:41:06,491 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2021-01-07 05:41:06,913 WARN L197 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2021-01-07 05:41:07,487 WARN L197 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 101 [2021-01-07 05:41:08,091 WARN L197 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 105 [2021-01-07 05:41:08,907 WARN L197 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 109 [2021-01-07 05:41:09,556 WARN L197 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 105 [2021-01-07 05:41:10,355 WARN L197 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 107 [2021-01-07 05:41:11,297 WARN L197 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 126 [2021-01-07 05:41:12,270 WARN L197 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 142 [2021-01-07 05:41:13,258 WARN L197 SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 142 [2021-01-07 05:41:14,323 WARN L197 SmtUtils]: Spent 875.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 146 [2021-01-07 05:41:15,382 WARN L197 SmtUtils]: Spent 885.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 146 [2021-01-07 05:41:16,019 WARN L197 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 109 [2021-01-07 05:41:16,625 WARN L197 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2021-01-07 05:41:16,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:41:16,652 INFO L93 Difference]: Finished difference Result 67 states and 66 transitions. [2021-01-07 05:41:16,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-07 05:41:16,653 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 62 [2021-01-07 05:41:16,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:41:16,653 INFO L225 Difference]: With dead ends: 67 [2021-01-07 05:41:16,653 INFO L226 Difference]: Without dead ends: 67 [2021-01-07 05:41:16,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=620, Invalid=4350, Unknown=0, NotChecked=0, Total=4970 [2021-01-07 05:41:16,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-01-07 05:41:16,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-01-07 05:41:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2021-01-07 05:41:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 66 transitions. [2021-01-07 05:41:16,657 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 66 transitions. Word has length 62 [2021-01-07 05:41:16,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:41:16,658 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 66 transitions. [2021-01-07 05:41:16,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2021-01-07 05:41:16,658 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 66 transitions. [2021-01-07 05:41:16,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-07 05:41:16,658 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:41:16,658 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:41:16,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-01-07 05:41:16,874 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:41:16,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:41:16,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1546431733, now seen corresponding path program 1 times [2021-01-07 05:41:16,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:41:16,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871916791] [2021-01-07 05:41:16,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:41:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-07 05:41:18,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871916791] [2021-01-07 05:41:18,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567437154] [2021-01-07 05:41:18,220 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:41:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:41:18,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 77 conjunts are in the unsatisfiable core [2021-01-07 05:41:18,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:41:18,491 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:18,492 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 63 [2021-01-07 05:41:18,497 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:18,515 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:18,516 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:41:18,517 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:31 [2021-01-07 05:41:18,874 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:41:18,875 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:18,897 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:18,898 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:41:18,898 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2021-01-07 05:41:19,130 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:19,130 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 56 [2021-01-07 05:41:19,138 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2021-01-07 05:41:19,138 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:41:19,139 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:19,160 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:19,162 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:41:19,162 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2021-01-07 05:41:19,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:41:19,757 INFO L348 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2021-01-07 05:41:19,757 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 57 treesize of output 57 [2021-01-07 05:41:19,760 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:19,799 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:19,802 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:41:19,802 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:54 [2021-01-07 05:41:20,311 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:20,311 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 122 [2021-01-07 05:41:20,314 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2021-01-07 05:41:20,315 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:41:20,318 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:20,384 INFO L625 ElimStorePlain]: treesize reduction 28, result has 68.2 percent of original size [2021-01-07 05:41:20,387 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:41:20,388 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:85, output treesize:43 [2021-01-07 05:41:20,785 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:20,786 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 [2021-01-07 05:41:20,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:41:20,790 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:41:20,790 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:41:20,822 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:20,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:41:20,828 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:41:20,837 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:41:20,838 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:41:20,838 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:38 [2021-01-07 05:41:20,840 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:41:20,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:41:21,207 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:41:21,226 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-01-07 05:41:21,228 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:21,274 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:21,275 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 50 [2021-01-07 05:41:21,280 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:21,385 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2021-01-07 05:41:21,386 INFO L625 ElimStorePlain]: treesize reduction 28, result has 68.9 percent of original size [2021-01-07 05:41:21,389 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:41:21,390 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2021-01-07 05:41:21,390 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:62 [2021-01-07 05:41:21,391 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:41:21,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:41:21,926 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:21,926 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:41:21,928 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:41:21,947 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:41:21,949 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:41:21,949 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:25 [2021-01-07 05:41:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 05:41:22,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:41:22,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2021-01-07 05:41:22,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433885642] [2021-01-07 05:41:22,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-01-07 05:41:22,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:41:22,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-01-07 05:41:22,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1965, Unknown=0, NotChecked=0, Total=2070 [2021-01-07 05:41:22,127 INFO L87 Difference]: Start difference. First operand 67 states and 66 transitions. Second operand 46 states. [2021-01-07 05:41:23,478 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2021-01-07 05:41:23,696 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2021-01-07 05:41:23,938 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2021-01-07 05:41:24,251 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2021-01-07 05:41:24,674 WARN L197 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 54 [2021-01-07 05:41:25,252 WARN L197 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 65 [2021-01-07 05:41:26,002 WARN L197 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 72 [2021-01-07 05:41:26,491 WARN L197 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 67 [2021-01-07 05:41:29,683 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2021-01-07 05:41:30,008 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 44 [2021-01-07 05:41:30,460 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 34 [2021-01-07 05:41:30,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:41:30,844 INFO L93 Difference]: Finished difference Result 66 states and 65 transitions. [2021-01-07 05:41:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-01-07 05:41:30,844 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 66 [2021-01-07 05:41:30,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:41:30,844 INFO L225 Difference]: With dead ends: 66 [2021-01-07 05:41:30,844 INFO L226 Difference]: Without dead ends: 0 [2021-01-07 05:41:30,845 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=334, Invalid=3956, Unknown=0, NotChecked=0, Total=4290 [2021-01-07 05:41:30,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-07 05:41:30,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-07 05:41:30,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-07 05:41:30,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-07 05:41:30,846 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2021-01-07 05:41:30,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:41:30,847 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-07 05:41:30,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2021-01-07 05:41:30,847 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-07 05:41:30,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-07 05:41:31,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-01-07 05:41:31,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 05:41:31 BoogieIcfgContainer [2021-01-07 05:41:31,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-07 05:41:31,057 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-07 05:41:31,058 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-07 05:41:31,058 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-07 05:41:31,059 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:39:23" (3/4) ... [2021-01-07 05:41:31,064 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-07 05:41:31,088 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2021-01-07 05:41:31,088 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-01-07 05:41:31,089 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-01-07 05:41:31,089 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-07 05:41:31,174 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/list-simple/sll2c_update_all.i-witness.graphml [2021-01-07 05:41:31,174 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-07 05:41:31,176 INFO L168 Benchmark]: Toolchain (without parser) took 129480.52 ms. Allocated memory was 159.4 MB in the beginning and 350.2 MB in the end (delta: 190.8 MB). Free memory was 134.2 MB in the beginning and 269.0 MB in the end (delta: -134.8 MB). Peak memory consumption was 56.2 MB. Max. memory is 8.0 GB. [2021-01-07 05:41:31,176 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 159.4 MB. Free memory is still 131.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-07 05:41:31,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.72 ms. Allocated memory is still 159.4 MB. Free memory was 134.0 MB in the beginning and 142.1 MB in the end (delta: -8.1 MB). Peak memory consumption was 26.8 MB. Max. memory is 8.0 GB. [2021-01-07 05:41:31,177 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.72 ms. Allocated memory is still 159.4 MB. Free memory was 142.1 MB in the beginning and 139.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-07 05:41:31,177 INFO L168 Benchmark]: Boogie Preprocessor took 88.32 ms. Allocated memory is still 159.4 MB. Free memory was 139.9 MB in the beginning and 137.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-07 05:41:31,177 INFO L168 Benchmark]: RCFGBuilder took 786.38 ms. Allocated memory is still 159.4 MB. Free memory was 137.9 MB in the beginning and 105.3 MB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 8.0 GB. [2021-01-07 05:41:31,178 INFO L168 Benchmark]: TraceAbstraction took 127585.93 ms. Allocated memory was 159.4 MB in the beginning and 350.2 MB in the end (delta: 190.8 MB). Free memory was 104.8 MB in the beginning and 273.2 MB in the end (delta: -168.3 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. [2021-01-07 05:41:31,178 INFO L168 Benchmark]: Witness Printer took 117.23 ms. Allocated memory is still 350.2 MB. Free memory was 273.2 MB in the beginning and 269.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-07 05:41:31,180 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 159.4 MB. Free memory is still 131.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 745.72 ms. Allocated memory is still 159.4 MB. Free memory was 134.0 MB in the beginning and 142.1 MB in the end (delta: -8.1 MB). Peak memory consumption was 26.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 143.72 ms. Allocated memory is still 159.4 MB. Free memory was 142.1 MB in the beginning and 139.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 88.32 ms. Allocated memory is still 159.4 MB. Free memory was 139.9 MB in the beginning and 137.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 786.38 ms. Allocated memory is still 159.4 MB. Free memory was 137.9 MB in the beginning and 105.3 MB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 127585.93 ms. Allocated memory was 159.4 MB in the beginning and 350.2 MB in the end (delta: 190.8 MB). Free memory was 104.8 MB in the beginning and 273.2 MB in the end (delta: -168.3 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. * Witness Printer took 117.23 ms. Allocated memory is still 350.2 MB. Free memory was 273.2 MB in the beginning and 269.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 599]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 637]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 599]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 615]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 618]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 618]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 615]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 620]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 32 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 86 locations, 32 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 127.5s, OverallIterations: 37, TraceHistogramMax: 3, AutomataDifference: 81.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1795 SDtfs, 16812 SDslu, 9933 SDs, 0 SdLazy, 15018 SolverSat, 1579 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 19.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1612 GetRequests, 667 SyntacticMatches, 10 SemanticMatches, 935 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7163 ImplicationChecksByTransitivity, 83.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 37 MinimizatonAttempts, 1105 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 37.1s InterpolantComputationTime, 2198 NumberOfCodeBlocks, 2198 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 2142 ConstructedInterpolants, 231 QuantifiedInterpolants, 1633450 SizeOfPredicates, 453 NumberOfNonLiveVariables, 5436 ConjunctsInSsa, 966 ConjunctsInUnsatCore, 56 InterpolantComputations, 20 PerfectInterpolantSequences, 421/664 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...