/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/forester-heap/dll-token-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 17:15:00,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 17:15:00,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 17:15:00,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 17:15:00,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 17:15:00,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 17:15:00,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 17:15:00,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 17:15:00,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 17:15:00,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 17:15:00,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 17:15:00,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 17:15:00,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 17:15:00,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 17:15:00,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 17:15:00,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 17:15:00,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 17:15:00,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 17:15:00,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 17:15:00,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 17:15:00,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 17:15:00,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 17:15:00,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 17:15:00,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 17:15:00,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 17:15:00,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 17:15:00,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 17:15:00,923 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 17:15:00,924 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 17:15:00,925 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 17:15:00,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 17:15:00,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 17:15:00,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 17:15:00,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 17:15:00,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 17:15:00,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 17:15:00,934 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 17:15:00,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 17:15:00,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 17:15:00,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 17:15:00,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 17:15:00,938 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2020-12-23 17:15:00,987 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 17:15:00,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 17:15:00,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 17:15:00,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 17:15:00,993 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 17:15:00,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 17:15:00,994 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-23 17:15:00,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 17:15:00,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 17:15:00,995 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-23 17:15:00,996 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-23 17:15:00,996 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-23 17:15:00,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 17:15:00,997 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-23 17:15:00,997 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 17:15:00,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 17:15:00,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 17:15:00,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 17:15:00,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 17:15:00,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 17:15:00,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 17:15:00,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 17:15:00,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 17:15:00,999 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 17:15:00,999 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 [2020-12-23 17:15:01,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 17:15:01,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 17:15:01,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 17:15:01,463 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 17:15:01,464 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 17:15:01,465 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-1.i [2020-12-23 17:15:01,552 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e79b02299/06263155dfaa423697176a385a4299bd/FLAG82440b7da [2020-12-23 17:15:02,286 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 17:15:02,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i [2020-12-23 17:15:02,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e79b02299/06263155dfaa423697176a385a4299bd/FLAG82440b7da [2020-12-23 17:15:02,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e79b02299/06263155dfaa423697176a385a4299bd [2020-12-23 17:15:02,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 17:15:02,551 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 17:15:02,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 17:15:02,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 17:15:02,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 17:15:02,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 05:15:02" (1/1) ... [2020-12-23 17:15:02,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da573c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:15:02, skipping insertion in model container [2020-12-23 17:15:02,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 05:15:02" (1/1) ... [2020-12-23 17:15:02,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 17:15:02,609 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],StructAccessExpression[IdentifierExpression[~head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],StructAccessExpression[IdentifierExpression[~x~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem6,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] [2020-12-23 17:15:02,892 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/forester-heap/dll-token-1.i[22229,22242] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],StructAccessExpression[IdentifierExpression[~x~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem9,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem9,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem10,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem10,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 17:15:02,899 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/forester-heap/dll-token-1.i[22398,22411] [2020-12-23 17:15:02,900 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/forester-heap/dll-token-1.i[22489,22502] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 17:15:02,902 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/forester-heap/dll-token-1.i[22571,22584] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 17:15:02,903 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/forester-heap/dll-token-1.i[22649,22662] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 17:15:02,906 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/forester-heap/dll-token-1.i[22795,22808] [2020-12-23 17:15:02,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 17:15:02,920 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],StructAccessExpression[IdentifierExpression[~head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],StructAccessExpression[IdentifierExpression[~x~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem6,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] [2020-12-23 17:15:02,961 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/forester-heap/dll-token-1.i[22229,22242] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],StructAccessExpression[IdentifierExpression[~x~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem9,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem9,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem10,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem10,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 17:15:02,964 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/forester-heap/dll-token-1.i[22398,22411] [2020-12-23 17:15:02,965 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/forester-heap/dll-token-1.i[22489,22502] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 17:15:02,966 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/forester-heap/dll-token-1.i[22571,22584] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 17:15:02,967 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/forester-heap/dll-token-1.i[22649,22662] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2020-12-23 17:15:02,969 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/forester-heap/dll-token-1.i[22795,22808] [2020-12-23 17:15:02,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 17:15:03,030 INFO L208 MainTranslator]: Completed translation [2020-12-23 17:15:03,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:15:03 WrapperNode [2020-12-23 17:15:03,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 17:15:03,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 17:15:03,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 17:15:03,033 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 17:15:03,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:15:03" (1/1) ... [2020-12-23 17:15:03,058 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:15:03" (1/1) ... [2020-12-23 17:15:03,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 17:15:03,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 17:15:03,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 17:15:03,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 17:15:03,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:15:03" (1/1) ... [2020-12-23 17:15:03,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:15:03" (1/1) ... [2020-12-23 17:15:03,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:15:03" (1/1) ... [2020-12-23 17:15:03,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:15:03" (1/1) ... [2020-12-23 17:15:03,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:15:03" (1/1) ... [2020-12-23 17:15:03,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:15:03" (1/1) ... [2020-12-23 17:15:03,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:15:03" (1/1) ... [2020-12-23 17:15:03,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 17:15:03,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 17:15:03,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 17:15:03,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 17:15:03,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:15:03" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 17:15:03,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 17:15:03,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 17:15:03,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 17:15:03,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 17:15:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 17:15:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 17:15:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 17:15:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 17:15:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 17:15:03,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 17:15:03,965 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 17:15:03,966 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2020-12-23 17:15:03,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 05:15:03 BoogieIcfgContainer [2020-12-23 17:15:03,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 17:15:03,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 17:15:03,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 17:15:03,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 17:15:03,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 05:15:02" (1/3) ... [2020-12-23 17:15:03,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63517e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 05:15:03, skipping insertion in model container [2020-12-23 17:15:03,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:15:03" (2/3) ... [2020-12-23 17:15:03,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63517e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 05:15:03, skipping insertion in model container [2020-12-23 17:15:03,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 05:15:03" (3/3) ... [2020-12-23 17:15:03,981 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2020-12-23 17:15:03,989 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 17:15:03,996 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 64 error locations. [2020-12-23 17:15:04,022 INFO L253 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2020-12-23 17:15:04,063 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 17:15:04,063 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-23 17:15:04,063 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 17:15:04,064 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 17:15:04,064 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 17:15:04,064 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 17:15:04,064 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 17:15:04,064 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 17:15:04,105 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states. [2020-12-23 17:15:04,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-23 17:15:04,115 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:04,117 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-23 17:15:04,118 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:04,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:04,126 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2020-12-23 17:15:04,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:04,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048823530] [2020-12-23 17:15:04,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:04,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048823530] [2020-12-23 17:15:04,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:04,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 17:15:04,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500441242] [2020-12-23 17:15:04,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:15:04,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:04,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:15:04,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:15:04,432 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 3 states. [2020-12-23 17:15:04,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:04,622 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2020-12-23 17:15:04,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:15:04,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-23 17:15:04,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:04,638 INFO L225 Difference]: With dead ends: 151 [2020-12-23 17:15:04,638 INFO L226 Difference]: Without dead ends: 149 [2020-12-23 17:15:04,640 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:15:04,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-12-23 17:15:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 129. [2020-12-23 17:15:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-12-23 17:15:04,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2020-12-23 17:15:04,693 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 3 [2020-12-23 17:15:04,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:04,694 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2020-12-23 17:15:04,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:15:04,694 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2020-12-23 17:15:04,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-23 17:15:04,695 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:04,695 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-23 17:15:04,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 17:15:04,696 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:04,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:04,697 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2020-12-23 17:15:04,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:04,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278244107] [2020-12-23 17:15:04,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:04,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:04,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278244107] [2020-12-23 17:15:04,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:04,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 17:15:04,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177230934] [2020-12-23 17:15:04,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:15:04,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:04,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:15:04,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:15:04,776 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 3 states. [2020-12-23 17:15:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:04,980 INFO L93 Difference]: Finished difference Result 154 states and 156 transitions. [2020-12-23 17:15:04,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:15:04,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-23 17:15:04,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:04,983 INFO L225 Difference]: With dead ends: 154 [2020-12-23 17:15:04,983 INFO L226 Difference]: Without dead ends: 154 [2020-12-23 17:15:04,984 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:15:04,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-12-23 17:15:04,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 126. [2020-12-23 17:15:04,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-12-23 17:15:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2020-12-23 17:15:04,998 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 3 [2020-12-23 17:15:04,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:04,999 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2020-12-23 17:15:04,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:15:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2020-12-23 17:15:04,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-23 17:15:04,999 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:05,000 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:05,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 17:15:05,000 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:05,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:05,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1837112018, now seen corresponding path program 1 times [2020-12-23 17:15:05,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:05,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352200566] [2020-12-23 17:15:05,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:05,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:05,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352200566] [2020-12-23 17:15:05,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:05,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 17:15:05,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430757913] [2020-12-23 17:15:05,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 17:15:05,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:05,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 17:15:05,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 17:15:05,102 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 4 states. [2020-12-23 17:15:05,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:05,277 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2020-12-23 17:15:05,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 17:15:05,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-23 17:15:05,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:05,279 INFO L225 Difference]: With dead ends: 130 [2020-12-23 17:15:05,280 INFO L226 Difference]: Without dead ends: 130 [2020-12-23 17:15:05,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:15:05,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-12-23 17:15:05,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 113. [2020-12-23 17:15:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-12-23 17:15:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2020-12-23 17:15:05,292 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 9 [2020-12-23 17:15:05,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:05,293 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2020-12-23 17:15:05,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 17:15:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2020-12-23 17:15:05,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-23 17:15:05,293 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:05,294 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:05,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 17:15:05,294 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:05,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:05,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1837112019, now seen corresponding path program 1 times [2020-12-23 17:15:05,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:05,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654857502] [2020-12-23 17:15:05,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:05,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654857502] [2020-12-23 17:15:05,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:05,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 17:15:05,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117696531] [2020-12-23 17:15:05,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 17:15:05,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:05,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 17:15:05,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 17:15:05,446 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 4 states. [2020-12-23 17:15:05,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:05,728 INFO L93 Difference]: Finished difference Result 203 states and 207 transitions. [2020-12-23 17:15:05,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 17:15:05,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-23 17:15:05,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:05,731 INFO L225 Difference]: With dead ends: 203 [2020-12-23 17:15:05,731 INFO L226 Difference]: Without dead ends: 203 [2020-12-23 17:15:05,732 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:15:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-12-23 17:15:05,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 148. [2020-12-23 17:15:05,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-12-23 17:15:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 163 transitions. [2020-12-23 17:15:05,745 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 163 transitions. Word has length 9 [2020-12-23 17:15:05,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:05,746 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 163 transitions. [2020-12-23 17:15:05,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 17:15:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 163 transitions. [2020-12-23 17:15:05,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-23 17:15:05,746 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:05,747 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:05,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 17:15:05,747 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:05,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:05,748 INFO L82 PathProgramCache]: Analyzing trace with hash 233113581, now seen corresponding path program 1 times [2020-12-23 17:15:05,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:05,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550854822] [2020-12-23 17:15:05,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:05,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550854822] [2020-12-23 17:15:05,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:05,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 17:15:05,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470409540] [2020-12-23 17:15:05,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:15:05,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:05,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:15:05,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:15:05,848 INFO L87 Difference]: Start difference. First operand 148 states and 163 transitions. Second operand 5 states. [2020-12-23 17:15:06,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:06,150 INFO L93 Difference]: Finished difference Result 217 states and 234 transitions. [2020-12-23 17:15:06,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 17:15:06,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-23 17:15:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:06,154 INFO L225 Difference]: With dead ends: 217 [2020-12-23 17:15:06,154 INFO L226 Difference]: Without dead ends: 217 [2020-12-23 17:15:06,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 17:15:06,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-12-23 17:15:06,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 147. [2020-12-23 17:15:06,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-12-23 17:15:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2020-12-23 17:15:06,188 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 11 [2020-12-23 17:15:06,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:06,188 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2020-12-23 17:15:06,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:15:06,188 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2020-12-23 17:15:06,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-23 17:15:06,189 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:06,190 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:06,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 17:15:06,191 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:06,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:06,193 INFO L82 PathProgramCache]: Analyzing trace with hash 233113582, now seen corresponding path program 1 times [2020-12-23 17:15:06,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:06,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242756994] [2020-12-23 17:15:06,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:06,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242756994] [2020-12-23 17:15:06,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:06,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 17:15:06,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981427653] [2020-12-23 17:15:06,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:15:06,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:06,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:15:06,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:15:06,314 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand 5 states. [2020-12-23 17:15:06,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:06,667 INFO L93 Difference]: Finished difference Result 243 states and 263 transitions. [2020-12-23 17:15:06,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 17:15:06,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-23 17:15:06,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:06,669 INFO L225 Difference]: With dead ends: 243 [2020-12-23 17:15:06,670 INFO L226 Difference]: Without dead ends: 243 [2020-12-23 17:15:06,670 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 17:15:06,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2020-12-23 17:15:06,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 146. [2020-12-23 17:15:06,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-23 17:15:06,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2020-12-23 17:15:06,677 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 11 [2020-12-23 17:15:06,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:06,678 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2020-12-23 17:15:06,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:15:06,678 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2020-12-23 17:15:06,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-23 17:15:06,679 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:06,679 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:06,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 17:15:06,679 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:06,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:06,680 INFO L82 PathProgramCache]: Analyzing trace with hash 662855318, now seen corresponding path program 1 times [2020-12-23 17:15:06,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:06,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081708393] [2020-12-23 17:15:06,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:06,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081708393] [2020-12-23 17:15:06,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:06,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 17:15:06,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270600690] [2020-12-23 17:15:06,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:15:06,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:06,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:15:06,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:15:06,749 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand 5 states. [2020-12-23 17:15:06,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:06,934 INFO L93 Difference]: Finished difference Result 153 states and 161 transitions. [2020-12-23 17:15:06,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 17:15:06,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-23 17:15:06,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:06,936 INFO L225 Difference]: With dead ends: 153 [2020-12-23 17:15:06,936 INFO L226 Difference]: Without dead ends: 153 [2020-12-23 17:15:06,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 17:15:06,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-12-23 17:15:06,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2020-12-23 17:15:06,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-12-23 17:15:06,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2020-12-23 17:15:06,942 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 13 [2020-12-23 17:15:06,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:06,942 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2020-12-23 17:15:06,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:15:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2020-12-23 17:15:06,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-23 17:15:06,943 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:06,944 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:06,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 17:15:06,944 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:06,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:06,945 INFO L82 PathProgramCache]: Analyzing trace with hash 662855319, now seen corresponding path program 1 times [2020-12-23 17:15:06,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:06,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304066077] [2020-12-23 17:15:06,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:07,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:07,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304066077] [2020-12-23 17:15:07,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:07,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 17:15:07,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604870178] [2020-12-23 17:15:07,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:15:07,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:07,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:15:07,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:15:07,010 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand 5 states. [2020-12-23 17:15:07,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:07,228 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2020-12-23 17:15:07,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 17:15:07,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-23 17:15:07,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:07,230 INFO L225 Difference]: With dead ends: 144 [2020-12-23 17:15:07,230 INFO L226 Difference]: Without dead ends: 144 [2020-12-23 17:15:07,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 17:15:07,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-12-23 17:15:07,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2020-12-23 17:15:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-12-23 17:15:07,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2020-12-23 17:15:07,235 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 13 [2020-12-23 17:15:07,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:07,235 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2020-12-23 17:15:07,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:15:07,235 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2020-12-23 17:15:07,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 17:15:07,236 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:07,236 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:07,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 17:15:07,237 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:07,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:07,237 INFO L82 PathProgramCache]: Analyzing trace with hash 51789359, now seen corresponding path program 1 times [2020-12-23 17:15:07,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:07,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053153940] [2020-12-23 17:15:07,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:07,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053153940] [2020-12-23 17:15:07,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:07,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 17:15:07,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075984981] [2020-12-23 17:15:07,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 17:15:07,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:07,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 17:15:07,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-23 17:15:07,364 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand 9 states. [2020-12-23 17:15:07,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:07,840 INFO L93 Difference]: Finished difference Result 148 states and 155 transitions. [2020-12-23 17:15:07,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 17:15:07,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-12-23 17:15:07,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:07,842 INFO L225 Difference]: With dead ends: 148 [2020-12-23 17:15:07,842 INFO L226 Difference]: Without dead ends: 148 [2020-12-23 17:15:07,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-12-23 17:15:07,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-12-23 17:15:07,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2020-12-23 17:15:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-12-23 17:15:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2020-12-23 17:15:07,852 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 15 [2020-12-23 17:15:07,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:07,853 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2020-12-23 17:15:07,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 17:15:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2020-12-23 17:15:07,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 17:15:07,854 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:07,854 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:07,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 17:15:07,855 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:07,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:07,858 INFO L82 PathProgramCache]: Analyzing trace with hash 51789360, now seen corresponding path program 1 times [2020-12-23 17:15:07,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:07,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637035301] [2020-12-23 17:15:07,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:08,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637035301] [2020-12-23 17:15:08,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:08,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 17:15:08,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228703708] [2020-12-23 17:15:08,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 17:15:08,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:08,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 17:15:08,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-12-23 17:15:08,032 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand 10 states. [2020-12-23 17:15:08,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:08,759 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2020-12-23 17:15:08,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 17:15:08,760 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-12-23 17:15:08,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:08,761 INFO L225 Difference]: With dead ends: 145 [2020-12-23 17:15:08,761 INFO L226 Difference]: Without dead ends: 145 [2020-12-23 17:15:08,762 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2020-12-23 17:15:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-12-23 17:15:08,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 121. [2020-12-23 17:15:08,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-12-23 17:15:08,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2020-12-23 17:15:08,765 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 15 [2020-12-23 17:15:08,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:08,766 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2020-12-23 17:15:08,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 17:15:08,766 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2020-12-23 17:15:08,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 17:15:08,766 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:08,767 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:08,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 17:15:08,767 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:08,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:08,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1136804742, now seen corresponding path program 1 times [2020-12-23 17:15:08,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:08,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260118730] [2020-12-23 17:15:08,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:08,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260118730] [2020-12-23 17:15:08,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:08,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 17:15:08,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26847575] [2020-12-23 17:15:08,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 17:15:08,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:08,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 17:15:08,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-23 17:15:08,881 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 8 states. [2020-12-23 17:15:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:09,329 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2020-12-23 17:15:09,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 17:15:09,330 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-12-23 17:15:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:09,331 INFO L225 Difference]: With dead ends: 124 [2020-12-23 17:15:09,331 INFO L226 Difference]: Without dead ends: 124 [2020-12-23 17:15:09,332 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-12-23 17:15:09,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-12-23 17:15:09,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2020-12-23 17:15:09,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-12-23 17:15:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2020-12-23 17:15:09,336 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 16 [2020-12-23 17:15:09,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:09,336 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2020-12-23 17:15:09,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 17:15:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2020-12-23 17:15:09,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 17:15:09,337 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:09,337 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:09,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 17:15:09,338 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:09,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:09,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1136804743, now seen corresponding path program 1 times [2020-12-23 17:15:09,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:09,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608253249] [2020-12-23 17:15:09,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:09,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608253249] [2020-12-23 17:15:09,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:09,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 17:15:09,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504990173] [2020-12-23 17:15:09,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 17:15:09,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:09,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 17:15:09,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-23 17:15:09,423 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand 8 states. [2020-12-23 17:15:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:09,789 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2020-12-23 17:15:09,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 17:15:09,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-12-23 17:15:09,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:09,791 INFO L225 Difference]: With dead ends: 123 [2020-12-23 17:15:09,791 INFO L226 Difference]: Without dead ends: 123 [2020-12-23 17:15:09,791 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-12-23 17:15:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-12-23 17:15:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2020-12-23 17:15:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-12-23 17:15:09,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2020-12-23 17:15:09,795 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 16 [2020-12-23 17:15:09,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:09,795 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2020-12-23 17:15:09,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 17:15:09,795 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2020-12-23 17:15:09,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-23 17:15:09,796 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:09,796 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:09,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 17:15:09,796 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:09,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:09,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1770033073, now seen corresponding path program 1 times [2020-12-23 17:15:09,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:09,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235387716] [2020-12-23 17:15:09,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:09,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235387716] [2020-12-23 17:15:09,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:09,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 17:15:09,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937465128] [2020-12-23 17:15:09,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 17:15:09,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:09,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 17:15:09,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-12-23 17:15:09,900 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand 10 states. [2020-12-23 17:15:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:10,458 INFO L93 Difference]: Finished difference Result 139 states and 146 transitions. [2020-12-23 17:15:10,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 17:15:10,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2020-12-23 17:15:10,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:10,461 INFO L225 Difference]: With dead ends: 139 [2020-12-23 17:15:10,462 INFO L226 Difference]: Without dead ends: 139 [2020-12-23 17:15:10,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2020-12-23 17:15:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-12-23 17:15:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 117. [2020-12-23 17:15:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-12-23 17:15:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2020-12-23 17:15:10,466 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 17 [2020-12-23 17:15:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:10,466 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2020-12-23 17:15:10,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 17:15:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2020-12-23 17:15:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-23 17:15:10,467 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:10,467 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:10,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 17:15:10,467 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:10,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:10,468 INFO L82 PathProgramCache]: Analyzing trace with hash -732918918, now seen corresponding path program 1 times [2020-12-23 17:15:10,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:10,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655835341] [2020-12-23 17:15:10,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:10,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:10,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655835341] [2020-12-23 17:15:10,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:10,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 17:15:10,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910322808] [2020-12-23 17:15:10,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 17:15:10,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:10,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 17:15:10,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 17:15:10,507 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 4 states. [2020-12-23 17:15:10,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:10,652 INFO L93 Difference]: Finished difference Result 177 states and 182 transitions. [2020-12-23 17:15:10,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 17:15:10,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-12-23 17:15:10,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:10,654 INFO L225 Difference]: With dead ends: 177 [2020-12-23 17:15:10,654 INFO L226 Difference]: Without dead ends: 177 [2020-12-23 17:15:10,655 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:15:10,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-12-23 17:15:10,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 115. [2020-12-23 17:15:10,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-12-23 17:15:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2020-12-23 17:15:10,659 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 19 [2020-12-23 17:15:10,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:10,659 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2020-12-23 17:15:10,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 17:15:10,659 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2020-12-23 17:15:10,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-23 17:15:10,660 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:10,660 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:10,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 17:15:10,661 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:10,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:10,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1155996332, now seen corresponding path program 1 times [2020-12-23 17:15:10,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:10,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741223579] [2020-12-23 17:15:10,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:10,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741223579] [2020-12-23 17:15:10,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:10,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 17:15:10,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271995466] [2020-12-23 17:15:10,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:15:10,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:10,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:15:10,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:15:10,709 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 5 states. [2020-12-23 17:15:10,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:10,845 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2020-12-23 17:15:10,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 17:15:10,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-12-23 17:15:10,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:10,847 INFO L225 Difference]: With dead ends: 113 [2020-12-23 17:15:10,847 INFO L226 Difference]: Without dead ends: 113 [2020-12-23 17:15:10,847 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 17:15:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-12-23 17:15:10,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-12-23 17:15:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-12-23 17:15:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2020-12-23 17:15:10,851 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 24 [2020-12-23 17:15:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:10,851 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2020-12-23 17:15:10,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:15:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2020-12-23 17:15:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-23 17:15:10,852 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:10,852 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:10,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 17:15:10,853 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:10,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:10,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1156029103, now seen corresponding path program 1 times [2020-12-23 17:15:10,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:10,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580425980] [2020-12-23 17:15:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:11,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580425980] [2020-12-23 17:15:11,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:11,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 17:15:11,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956141530] [2020-12-23 17:15:11,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 17:15:11,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:11,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 17:15:11,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-12-23 17:15:11,148 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 12 states. [2020-12-23 17:15:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:11,734 INFO L93 Difference]: Finished difference Result 215 states and 219 transitions. [2020-12-23 17:15:11,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 17:15:11,734 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-12-23 17:15:11,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:11,736 INFO L225 Difference]: With dead ends: 215 [2020-12-23 17:15:11,736 INFO L226 Difference]: Without dead ends: 215 [2020-12-23 17:15:11,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2020-12-23 17:15:11,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-12-23 17:15:11,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 128. [2020-12-23 17:15:11,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-12-23 17:15:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2020-12-23 17:15:11,740 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 24 [2020-12-23 17:15:11,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:11,741 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2020-12-23 17:15:11,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 17:15:11,741 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2020-12-23 17:15:11,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 17:15:11,742 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:11,742 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:11,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 17:15:11,742 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:11,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:11,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1243007893, now seen corresponding path program 1 times [2020-12-23 17:15:11,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:11,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036868687] [2020-12-23 17:15:11,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:11,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036868687] [2020-12-23 17:15:11,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:11,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 17:15:11,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337268286] [2020-12-23 17:15:11,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 17:15:11,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:11,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 17:15:11,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-23 17:15:11,957 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 12 states. [2020-12-23 17:15:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:12,533 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions. [2020-12-23 17:15:12,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 17:15:12,533 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-12-23 17:15:12,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:12,534 INFO L225 Difference]: With dead ends: 181 [2020-12-23 17:15:12,535 INFO L226 Difference]: Without dead ends: 181 [2020-12-23 17:15:12,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2020-12-23 17:15:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-12-23 17:15:12,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 134. [2020-12-23 17:15:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-12-23 17:15:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2020-12-23 17:15:12,539 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 27 [2020-12-23 17:15:12,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:12,539 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2020-12-23 17:15:12,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 17:15:12,540 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2020-12-23 17:15:12,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 17:15:12,540 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:12,541 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:12,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 17:15:12,541 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:12,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:12,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1243007894, now seen corresponding path program 1 times [2020-12-23 17:15:12,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:12,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178693365] [2020-12-23 17:15:12,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:12,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:12,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178693365] [2020-12-23 17:15:12,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:12,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 17:15:12,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176851890] [2020-12-23 17:15:12,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 17:15:12,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:12,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 17:15:12,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-12-23 17:15:12,767 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand 12 states. [2020-12-23 17:15:13,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:13,499 INFO L93 Difference]: Finished difference Result 213 states and 217 transitions. [2020-12-23 17:15:13,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 17:15:13,499 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-12-23 17:15:13,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:13,500 INFO L225 Difference]: With dead ends: 213 [2020-12-23 17:15:13,501 INFO L226 Difference]: Without dead ends: 213 [2020-12-23 17:15:13,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2020-12-23 17:15:13,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-12-23 17:15:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 134. [2020-12-23 17:15:13,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-12-23 17:15:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2020-12-23 17:15:13,505 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 27 [2020-12-23 17:15:13,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:13,505 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2020-12-23 17:15:13,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 17:15:13,506 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2020-12-23 17:15:13,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 17:15:13,506 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:13,507 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:13,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 17:15:13,507 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:13,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:13,508 INFO L82 PathProgramCache]: Analyzing trace with hash 529681397, now seen corresponding path program 1 times [2020-12-23 17:15:13,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:13,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787674091] [2020-12-23 17:15:13,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:13,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787674091] [2020-12-23 17:15:13,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:13,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 17:15:13,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93559339] [2020-12-23 17:15:13,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-23 17:15:13,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:13,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-23 17:15:13,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-12-23 17:15:13,786 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 14 states. [2020-12-23 17:15:14,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:14,919 INFO L93 Difference]: Finished difference Result 211 states and 215 transitions. [2020-12-23 17:15:14,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 17:15:14,919 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2020-12-23 17:15:14,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:14,921 INFO L225 Difference]: With dead ends: 211 [2020-12-23 17:15:14,921 INFO L226 Difference]: Without dead ends: 211 [2020-12-23 17:15:14,922 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2020-12-23 17:15:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-12-23 17:15:14,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 135. [2020-12-23 17:15:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-12-23 17:15:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2020-12-23 17:15:14,926 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 29 [2020-12-23 17:15:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:14,926 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2020-12-23 17:15:14,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-23 17:15:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2020-12-23 17:15:14,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 17:15:14,928 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:14,928 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:14,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 17:15:14,928 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:14,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:14,929 INFO L82 PathProgramCache]: Analyzing trace with hash 341018096, now seen corresponding path program 1 times [2020-12-23 17:15:14,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:14,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950586542] [2020-12-23 17:15:14,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:14,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950586542] [2020-12-23 17:15:14,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:14,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 17:15:14,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563483157] [2020-12-23 17:15:14,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 17:15:14,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:14,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 17:15:14,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:15:14,975 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand 5 states. [2020-12-23 17:15:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:15,149 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2020-12-23 17:15:15,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 17:15:15,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-12-23 17:15:15,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:15,152 INFO L225 Difference]: With dead ends: 133 [2020-12-23 17:15:15,152 INFO L226 Difference]: Without dead ends: 133 [2020-12-23 17:15:15,152 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 17:15:15,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-12-23 17:15:15,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-12-23 17:15:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-12-23 17:15:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2020-12-23 17:15:15,156 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 35 [2020-12-23 17:15:15,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:15,156 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2020-12-23 17:15:15,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 17:15:15,157 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2020-12-23 17:15:15,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 17:15:15,158 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:15,158 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:15,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 17:15:15,158 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:15,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:15,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1506257976, now seen corresponding path program 1 times [2020-12-23 17:15:15,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:15,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486130441] [2020-12-23 17:15:15,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:15,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486130441] [2020-12-23 17:15:15,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504733731] [2020-12-23 17:15:15,809 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 [2020-12-23 17:15:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:15,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 47 conjunts are in the unsatisfiable core [2020-12-23 17:15:15,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:15:16,005 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:15:16,008 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:16,018 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:16,019 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:16,020 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:15:16,043 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 17:15:16,045 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:16,055 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:16,056 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:16,057 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2020-12-23 17:15:16,150 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:16,151 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-23 17:15:16,168 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:16,175 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:16,189 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:16,192 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:16,193 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:35 [2020-12-23 17:15:16,287 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_29|], 2=[|v_#memory_int_29|]} [2020-12-23 17:15:16,293 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:15:16,294 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:16,316 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:16,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:15:16,324 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-12-23 17:15:16,326 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:16,343 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:16,346 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:16,347 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:43 [2020-12-23 17:15:16,568 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:16,569 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 70 treesize of output 76 [2020-12-23 17:15:16,577 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-23 17:15:16,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:15:16,581 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-23 17:15:16,632 INFO L625 ElimStorePlain]: treesize reduction 52, result has 62.6 percent of original size [2020-12-23 17:15:16,638 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2020-12-23 17:15:16,640 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:16,657 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:16,660 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:15:16,660 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:56 [2020-12-23 17:15:16,771 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:16,773 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2020-12-23 17:15:16,779 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:16,791 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:16,795 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:16,795 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:27 [2020-12-23 17:15:16,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:15:16,880 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-12-23 17:15:16,881 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:16,894 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:16,895 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:16,895 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:36 [2020-12-23 17:15:16,962 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2020-12-23 17:15:16,965 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:16,977 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:16,979 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:16,979 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:36 [2020-12-23 17:15:17,055 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:17,056 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-23 17:15:17,059 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:15:17,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:17,064 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:17,075 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:17,077 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:17,077 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:34 [2020-12-23 17:15:17,132 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_31|], 6=[|v_#memory_int_33|]} [2020-12-23 17:15:17,137 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:15:17,138 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:17,156 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:17,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:15:17,163 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2020-12-23 17:15:17,165 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:17,178 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:17,180 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:17,180 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:42 [2020-12-23 17:15:17,311 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_32|], 6=[|v_#memory_int_34|]} [2020-12-23 17:15:17,335 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:17,336 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 75 [2020-12-23 17:15:17,341 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-23 17:15:17,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:15:17,343 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:17,365 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:17,372 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2020-12-23 17:15:17,376 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:17,391 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:17,393 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:15:17,394 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:55 [2020-12-23 17:15:17,500 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:17,501 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 32 [2020-12-23 17:15:17,503 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:17,516 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:17,520 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:15:17,520 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:34 [2020-12-23 17:15:17,603 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2020-12-23 17:15:17,604 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:17,621 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:17,629 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 17:15:17,630 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:43 [2020-12-23 17:15:17,964 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2020-12-23 17:15:17,972 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:17,980 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:17,983 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:17,983 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2020-12-23 17:15:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:18,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:15:18,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 34 [2020-12-23 17:15:18,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020567068] [2020-12-23 17:15:18,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-12-23 17:15:18,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:18,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-12-23 17:15:18,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2020-12-23 17:15:18,007 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand 34 states. [2020-12-23 17:15:24,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:24,766 INFO L93 Difference]: Finished difference Result 250 states and 259 transitions. [2020-12-23 17:15:24,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-23 17:15:24,767 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 35 [2020-12-23 17:15:24,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:24,770 INFO L225 Difference]: With dead ends: 250 [2020-12-23 17:15:24,770 INFO L226 Difference]: Without dead ends: 250 [2020-12-23 17:15:24,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=472, Invalid=2284, Unknown=0, NotChecked=0, Total=2756 [2020-12-23 17:15:24,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-12-23 17:15:24,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 159. [2020-12-23 17:15:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-12-23 17:15:24,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2020-12-23 17:15:24,783 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 35 [2020-12-23 17:15:24,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:24,784 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2020-12-23 17:15:24,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-12-23 17:15:24,784 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2020-12-23 17:15:24,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 17:15:24,788 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:24,788 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:25,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2020-12-23 17:15:25,003 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:25,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:25,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1983009931, now seen corresponding path program 1 times [2020-12-23 17:15:25,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:25,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273262774] [2020-12-23 17:15:25,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:25,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:25,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273262774] [2020-12-23 17:15:25,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:25,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 17:15:25,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538125425] [2020-12-23 17:15:25,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 17:15:25,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:25,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 17:15:25,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 17:15:25,098 INFO L87 Difference]: Start difference. First operand 159 states and 170 transitions. Second operand 4 states. [2020-12-23 17:15:25,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:25,242 INFO L93 Difference]: Finished difference Result 168 states and 175 transitions. [2020-12-23 17:15:25,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 17:15:25,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-23 17:15:25,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:25,245 INFO L225 Difference]: With dead ends: 168 [2020-12-23 17:15:25,246 INFO L226 Difference]: Without dead ends: 168 [2020-12-23 17:15:25,246 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:15:25,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-12-23 17:15:25,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 161. [2020-12-23 17:15:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-12-23 17:15:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 172 transitions. [2020-12-23 17:15:25,250 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 172 transitions. Word has length 36 [2020-12-23 17:15:25,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:25,251 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 172 transitions. [2020-12-23 17:15:25,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 17:15:25,251 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 172 transitions. [2020-12-23 17:15:25,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 17:15:25,252 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:25,252 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:25,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 17:15:25,252 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:25,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:25,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1301009014, now seen corresponding path program 1 times [2020-12-23 17:15:25,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:25,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725074028] [2020-12-23 17:15:25,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:25,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:25,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725074028] [2020-12-23 17:15:25,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:25,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 17:15:25,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324206593] [2020-12-23 17:15:25,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 17:15:25,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:25,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 17:15:25,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-12-23 17:15:25,423 INFO L87 Difference]: Start difference. First operand 161 states and 172 transitions. Second operand 12 states. [2020-12-23 17:15:26,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:26,032 INFO L93 Difference]: Finished difference Result 220 states and 226 transitions. [2020-12-23 17:15:26,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 17:15:26,033 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2020-12-23 17:15:26,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:26,034 INFO L225 Difference]: With dead ends: 220 [2020-12-23 17:15:26,034 INFO L226 Difference]: Without dead ends: 220 [2020-12-23 17:15:26,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2020-12-23 17:15:26,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-12-23 17:15:26,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 170. [2020-12-23 17:15:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-12-23 17:15:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 182 transitions. [2020-12-23 17:15:26,040 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 182 transitions. Word has length 37 [2020-12-23 17:15:26,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:26,040 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 182 transitions. [2020-12-23 17:15:26,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 17:15:26,040 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 182 transitions. [2020-12-23 17:15:26,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 17:15:26,041 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:26,041 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:26,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 17:15:26,041 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:26,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:26,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1676574036, now seen corresponding path program 1 times [2020-12-23 17:15:26,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:26,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131821183] [2020-12-23 17:15:26,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:26,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131821183] [2020-12-23 17:15:26,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:15:26,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 17:15:26,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028127939] [2020-12-23 17:15:26,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 17:15:26,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:26,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 17:15:26,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-12-23 17:15:26,233 INFO L87 Difference]: Start difference. First operand 170 states and 182 transitions. Second operand 12 states. [2020-12-23 17:15:26,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:26,951 INFO L93 Difference]: Finished difference Result 219 states and 225 transitions. [2020-12-23 17:15:26,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 17:15:26,952 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2020-12-23 17:15:26,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:26,954 INFO L225 Difference]: With dead ends: 219 [2020-12-23 17:15:26,954 INFO L226 Difference]: Without dead ends: 219 [2020-12-23 17:15:26,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2020-12-23 17:15:26,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-12-23 17:15:26,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 171. [2020-12-23 17:15:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-12-23 17:15:26,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 183 transitions. [2020-12-23 17:15:26,960 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 183 transitions. Word has length 38 [2020-12-23 17:15:26,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:26,960 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 183 transitions. [2020-12-23 17:15:26,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 17:15:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 183 transitions. [2020-12-23 17:15:26,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 17:15:26,961 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:26,961 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:26,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 17:15:26,962 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:26,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:26,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1292928196, now seen corresponding path program 1 times [2020-12-23 17:15:26,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:26,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079327142] [2020-12-23 17:15:26,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:27,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079327142] [2020-12-23 17:15:27,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466645805] [2020-12-23 17:15:27,241 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 [2020-12-23 17:15:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:27,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 40 conjunts are in the unsatisfiable core [2020-12-23 17:15:27,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:15:27,334 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:15:27,335 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:27,339 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:27,339 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:27,339 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:15:27,454 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:27,454 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-23 17:15:27,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:27,461 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:27,471 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:27,472 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:27,472 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-12-23 17:15:27,512 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:15:27,513 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:27,525 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:27,526 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:27,527 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2020-12-23 17:15:27,664 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:27,665 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2020-12-23 17:15:27,668 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-23 17:15:27,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:15:27,670 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-23 17:15:27,705 INFO L625 ElimStorePlain]: treesize reduction 33, result has 57.7 percent of original size [2020-12-23 17:15:27,707 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:15:27,707 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2020-12-23 17:15:27,910 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:27,911 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 127 [2020-12-23 17:15:27,919 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-23 17:15:27,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:15:27,924 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:27,956 INFO L625 ElimStorePlain]: treesize reduction 30, result has 60.0 percent of original size [2020-12-23 17:15:27,959 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:27,959 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:70, output treesize:26 [2020-12-23 17:15:28,259 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 [2020-12-23 17:15:28,260 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:28,270 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:28,272 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:28,272 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2020-12-23 17:15:28,342 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 [2020-12-23 17:15:28,344 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:28,353 INFO L625 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2020-12-23 17:15:28,354 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:15:28,354 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2020-12-23 17:15:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:28,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:15:28,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2020-12-23 17:15:28,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812511854] [2020-12-23 17:15:28,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-12-23 17:15:28,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:28,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-12-23 17:15:28,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2020-12-23 17:15:28,408 INFO L87 Difference]: Start difference. First operand 171 states and 183 transitions. Second operand 32 states. [2020-12-23 17:15:30,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:30,483 INFO L93 Difference]: Finished difference Result 222 states and 228 transitions. [2020-12-23 17:15:30,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-23 17:15:30,484 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2020-12-23 17:15:30,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:30,485 INFO L225 Difference]: With dead ends: 222 [2020-12-23 17:15:30,485 INFO L226 Difference]: Without dead ends: 222 [2020-12-23 17:15:30,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=402, Invalid=1668, Unknown=0, NotChecked=0, Total=2070 [2020-12-23 17:15:30,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-12-23 17:15:30,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 177. [2020-12-23 17:15:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-12-23 17:15:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 190 transitions. [2020-12-23 17:15:30,491 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 190 transitions. Word has length 38 [2020-12-23 17:15:30,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:30,491 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 190 transitions. [2020-12-23 17:15:30,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-12-23 17:15:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 190 transitions. [2020-12-23 17:15:30,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 17:15:30,492 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:30,492 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:30,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-12-23 17:15:30,708 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:30,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:30,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1292928195, now seen corresponding path program 1 times [2020-12-23 17:15:30,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:30,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949139570] [2020-12-23 17:15:30,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:30,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:30,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949139570] [2020-12-23 17:15:30,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236620530] [2020-12-23 17:15:30,831 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 [2020-12-23 17:15:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:30,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 32 conjunts are in the unsatisfiable core [2020-12-23 17:15:30,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:15:31,093 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2020-12-23 17:15:31,094 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:31,104 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:31,107 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 16 [2020-12-23 17:15:31,108 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:31,117 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:31,119 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:31,119 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:13 [2020-12-23 17:15:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:31,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:15:31,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2020-12-23 17:15:31,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399814360] [2020-12-23 17:15:31,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 17:15:31,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:31,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 17:15:31,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-12-23 17:15:31,133 INFO L87 Difference]: Start difference. First operand 177 states and 190 transitions. Second operand 15 states. [2020-12-23 17:15:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:32,105 INFO L93 Difference]: Finished difference Result 238 states and 245 transitions. [2020-12-23 17:15:32,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 17:15:32,106 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2020-12-23 17:15:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:32,107 INFO L225 Difference]: With dead ends: 238 [2020-12-23 17:15:32,107 INFO L226 Difference]: Without dead ends: 238 [2020-12-23 17:15:32,108 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2020-12-23 17:15:32,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-12-23 17:15:32,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 187. [2020-12-23 17:15:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-12-23 17:15:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 204 transitions. [2020-12-23 17:15:32,113 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 204 transitions. Word has length 38 [2020-12-23 17:15:32,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:32,114 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 204 transitions. [2020-12-23 17:15:32,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 17:15:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2020-12-23 17:15:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 17:15:32,115 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:32,115 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:32,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-12-23 17:15:32,324 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:32,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:32,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1859165844, now seen corresponding path program 1 times [2020-12-23 17:15:32,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:32,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698213691] [2020-12-23 17:15:32,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:32,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:32,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698213691] [2020-12-23 17:15:32,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174420001] [2020-12-23 17:15:32,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:15:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:32,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 42 conjunts are in the unsatisfiable core [2020-12-23 17:15:32,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:15:32,799 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:15:32,800 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:32,804 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:32,805 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:32,806 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:15:32,878 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:32,879 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2020-12-23 17:15:32,881 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:32,901 INFO L625 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2020-12-23 17:15:32,902 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:15:32,902 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20 [2020-12-23 17:15:33,042 INFO L348 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2020-12-23 17:15:33,042 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2020-12-23 17:15:33,044 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-23 17:15:33,057 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:33,058 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:33,058 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:31 [2020-12-23 17:15:33,119 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:33,152 INFO L348 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2020-12-23 17:15:33,152 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2020-12-23 17:15:33,154 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-23 17:15:33,158 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-23 17:15:33,159 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:33,173 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:33,174 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:33,174 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:82, output treesize:31 [2020-12-23 17:15:33,189 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:15:33,208 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:33,208 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 42 [2020-12-23 17:15:33,211 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:33,213 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:33,277 INFO L348 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2020-12-23 17:15:33,278 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 69 [2020-12-23 17:15:33,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:15:33,282 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:33,284 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:15:33,286 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:33,286 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:33,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:33,291 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:33,324 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:33,325 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-23 17:15:33,326 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:66, output treesize:61 [2020-12-23 17:15:33,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:33,437 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:33,437 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2020-12-23 17:15:33,439 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:33,444 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-23 17:15:33,445 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:33,503 INFO L625 ElimStorePlain]: treesize reduction 16, result has 76.5 percent of original size [2020-12-23 17:15:33,505 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:33,505 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:57 [2020-12-23 17:15:33,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:15:33,747 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:33,756 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 111 [2020-12-23 17:15:33,762 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-12-23 17:15:33,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:15:33,764 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:33,788 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:33,789 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 47 treesize of output 61 [2020-12-23 17:15:33,792 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-23 17:15:33,792 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:15:33,793 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:33,899 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2020-12-23 17:15:33,900 INFO L625 ElimStorePlain]: treesize reduction 22, result has 83.5 percent of original size [2020-12-23 17:15:33,902 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-12-23 17:15:33,903 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:140, output treesize:111 [2020-12-23 17:15:34,047 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 9, 1] term [2020-12-23 17:15:34,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:34,184 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:34,200 INFO L443 ElimStorePlain]: Different costs {6=[v_prenex_2], 12=[|v_#memory_$Pointer$.base_40|]} [2020-12-23 17:15:34,248 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:34,248 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 127 [2020-12-23 17:15:34,251 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-23 17:15:34,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:15:34,253 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:34,354 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2020-12-23 17:15:34,355 INFO L625 ElimStorePlain]: treesize reduction 30, result has 85.4 percent of original size [2020-12-23 17:15:34,460 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:34,460 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 206 [2020-12-23 17:15:34,467 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-12-23 17:15:34,467 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:15:34,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:15:34,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:15:34,472 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:15:34,475 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-23 17:15:34,599 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-12-23 17:15:34,600 INFO L625 ElimStorePlain]: treesize reduction 168, result has 45.1 percent of original size [2020-12-23 17:15:34,606 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-12-23 17:15:34,606 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:200, output treesize:92 [2020-12-23 17:15:34,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:34,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:15:34,880 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:34,880 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 58 treesize of output 37 [2020-12-23 17:15:34,884 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:15:34,891 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 [2020-12-23 17:15:34,893 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:34,961 INFO L625 ElimStorePlain]: treesize reduction 9, result has 85.9 percent of original size [2020-12-23 17:15:34,967 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-12-23 17:15:34,967 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:109, output treesize:36 [2020-12-23 17:15:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:35,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:15:35,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2020-12-23 17:15:35,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875377458] [2020-12-23 17:15:35,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-12-23 17:15:35,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:35,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-12-23 17:15:35,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=920, Unknown=0, NotChecked=0, Total=1056 [2020-12-23 17:15:35,112 INFO L87 Difference]: Start difference. First operand 187 states and 204 transitions. Second operand 33 states. [2020-12-23 17:15:36,282 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2020-12-23 17:15:36,503 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2020-12-23 17:15:36,698 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-23 17:15:36,991 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2020-12-23 17:15:38,131 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-12-23 17:15:39,197 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 35 [2020-12-23 17:15:39,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:39,560 INFO L93 Difference]: Finished difference Result 263 states and 280 transitions. [2020-12-23 17:15:39,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-12-23 17:15:39,561 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 38 [2020-12-23 17:15:39,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:39,562 INFO L225 Difference]: With dead ends: 263 [2020-12-23 17:15:39,562 INFO L226 Difference]: Without dead ends: 263 [2020-12-23 17:15:39,563 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=532, Invalid=2438, Unknown=0, NotChecked=0, Total=2970 [2020-12-23 17:15:39,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-12-23 17:15:39,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 193. [2020-12-23 17:15:39,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-12-23 17:15:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 211 transitions. [2020-12-23 17:15:39,569 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 211 transitions. Word has length 38 [2020-12-23 17:15:39,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:39,569 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 211 transitions. [2020-12-23 17:15:39,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-12-23 17:15:39,570 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 211 transitions. [2020-12-23 17:15:39,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 17:15:39,570 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:39,570 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:39,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:15:39,786 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:39,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:39,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1859165843, now seen corresponding path program 1 times [2020-12-23 17:15:39,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:39,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767263885] [2020-12-23 17:15:39,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:40,244 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2020-12-23 17:15:40,499 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-12-23 17:15:40,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:40,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767263885] [2020-12-23 17:15:40,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183230954] [2020-12-23 17:15:40,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:15:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:40,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 56 conjunts are in the unsatisfiable core [2020-12-23 17:15:40,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:15:40,956 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:15:40,956 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:40,960 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:40,961 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:40,961 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:15:41,041 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_58|], 3=[|v_#valid_80|]} [2020-12-23 17:15:41,045 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:15:41,046 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:41,062 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:41,082 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:41,083 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-23 17:15:41,085 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:41,087 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:41,105 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:41,106 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:41,106 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2020-12-23 17:15:41,177 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:15:41,178 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:41,198 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:41,204 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:15:41,204 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:41,226 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:41,228 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:41,229 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2020-12-23 17:15:41,385 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:41,385 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 69 treesize of output 75 [2020-12-23 17:15:41,390 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-23 17:15:41,390 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:15:41,392 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-23 17:15:41,455 INFO L625 ElimStorePlain]: treesize reduction 51, result has 61.7 percent of original size [2020-12-23 17:15:41,461 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2020-12-23 17:15:41,465 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:41,492 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:41,494 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:15:41,494 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:74 [2020-12-23 17:15:41,780 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:41,781 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 40 treesize of output 63 [2020-12-23 17:15:41,786 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:41,862 INFO L625 ElimStorePlain]: treesize reduction 26, result has 79.4 percent of original size [2020-12-23 17:15:41,943 INFO L348 Elim1Store]: treesize reduction 52, result has 50.5 percent of original size [2020-12-23 17:15:41,944 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 85 treesize of output 91 [2020-12-23 17:15:41,952 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:41,984 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:41,989 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:41,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:41,992 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:41,992 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:113, output treesize:37 [2020-12-23 17:15:42,069 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 17:15:42,071 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:42,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:42,094 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 17:15:42,095 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:42,112 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:42,113 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:42,114 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:37 [2020-12-23 17:15:42,122 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_59|], 3=[|v_#valid_81|]} [2020-12-23 17:15:42,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:15:42,128 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-23 17:15:42,130 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:42,151 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:42,169 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:42,170 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-23 17:15:42,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:15:42,173 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:42,174 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:42,192 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:42,193 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:42,193 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2020-12-23 17:15:42,264 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-12-23 17:15:42,265 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:42,288 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:42,293 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-12-23 17:15:42,295 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:42,325 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:42,327 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:42,327 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:52 [2020-12-23 17:15:42,476 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_34|], 6=[|v_#memory_$Pointer$.base_46|]} [2020-12-23 17:15:42,482 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2020-12-23 17:15:42,483 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:42,509 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:42,553 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:42,553 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 108 [2020-12-23 17:15:42,557 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-12-23 17:15:42,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:15:42,559 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:42,581 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:42,583 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:15:42,584 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:78 [2020-12-23 17:15:42,791 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_35|], 12=[|v_#memory_$Pointer$.base_47|]} [2020-12-23 17:15:42,816 INFO L348 Elim1Store]: treesize reduction 41, result has 37.9 percent of original size [2020-12-23 17:15:42,816 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 39 [2020-12-23 17:15:42,818 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:42,852 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:42,957 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-12-23 17:15:42,958 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:42,958 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 225 [2020-12-23 17:15:42,965 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 1] term [2020-12-23 17:15:42,965 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:15:42,967 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-12-23 17:15:42,968 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:15:42,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-12-23 17:15:42,974 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2020-12-23 17:15:43,072 INFO L625 ElimStorePlain]: treesize reduction 361, result has 24.8 percent of original size [2020-12-23 17:15:43,075 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-12-23 17:15:43,075 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:43,079 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. [2020-12-23 17:15:43,079 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:193, output treesize:69 [2020-12-23 17:15:43,316 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2020-12-23 17:15:43,320 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 17:15:43,321 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:43,343 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:43,352 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:43,352 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 66 treesize of output 41 [2020-12-23 17:15:43,356 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:15:43,373 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:43,376 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. [2020-12-23 17:15:43,376 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:86, output treesize:18 [2020-12-23 17:15:43,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:43,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:15:43,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 35 [2020-12-23 17:15:43,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761704766] [2020-12-23 17:15:43,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-12-23 17:15:43,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:43,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-12-23 17:15:43,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1120, Unknown=0, NotChecked=0, Total=1260 [2020-12-23 17:15:43,547 INFO L87 Difference]: Start difference. First operand 193 states and 211 transitions. Second operand 36 states. [2020-12-23 17:15:44,316 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2020-12-23 17:15:44,651 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2020-12-23 17:15:44,818 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 43 [2020-12-23 17:15:44,963 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2020-12-23 17:15:45,176 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2020-12-23 17:15:45,512 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2020-12-23 17:15:46,382 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 41 [2020-12-23 17:15:46,609 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 43 [2020-12-23 17:15:46,831 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 54 [2020-12-23 17:15:47,026 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2020-12-23 17:15:47,203 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 52 [2020-12-23 17:15:47,608 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 70 [2020-12-23 17:15:47,887 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 47 [2020-12-23 17:15:48,439 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 42 [2020-12-23 17:15:48,909 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2020-12-23 17:15:50,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:50,876 INFO L93 Difference]: Finished difference Result 327 states and 341 transitions. [2020-12-23 17:15:50,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-12-23 17:15:50,876 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 38 [2020-12-23 17:15:50,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:50,879 INFO L225 Difference]: With dead ends: 327 [2020-12-23 17:15:50,879 INFO L226 Difference]: Without dead ends: 327 [2020-12-23 17:15:50,881 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=921, Invalid=4629, Unknown=0, NotChecked=0, Total=5550 [2020-12-23 17:15:50,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-12-23 17:15:50,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 193. [2020-12-23 17:15:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-12-23 17:15:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 210 transitions. [2020-12-23 17:15:50,887 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 210 transitions. Word has length 38 [2020-12-23 17:15:50,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:50,887 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 210 transitions. [2020-12-23 17:15:50,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-12-23 17:15:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 210 transitions. [2020-12-23 17:15:50,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 17:15:50,888 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:50,888 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:51,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-12-23 17:15:51,095 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:51,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:51,095 INFO L82 PathProgramCache]: Analyzing trace with hash -882911830, now seen corresponding path program 1 times [2020-12-23 17:15:51,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:51,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033150588] [2020-12-23 17:15:51,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:51,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033150588] [2020-12-23 17:15:51,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610845861] [2020-12-23 17:15:51,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:15:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:51,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 41 conjunts are in the unsatisfiable core [2020-12-23 17:15:51,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:15:51,640 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:15:51,641 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:51,646 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:51,646 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:51,647 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:15:51,754 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:51,754 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-23 17:15:51,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:51,759 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:51,771 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:51,772 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:51,772 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-12-23 17:15:51,828 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:15:51,829 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:51,845 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:51,846 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:51,847 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2020-12-23 17:15:51,994 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:51,995 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2020-12-23 17:15:51,997 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-23 17:15:51,997 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:15:51,999 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-23 17:15:52,036 INFO L625 ElimStorePlain]: treesize reduction 33, result has 57.7 percent of original size [2020-12-23 17:15:52,037 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:15:52,038 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2020-12-23 17:15:52,344 INFO L348 Elim1Store]: treesize reduction 52, result has 50.5 percent of original size [2020-12-23 17:15:52,345 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 57 treesize of output 71 [2020-12-23 17:15:52,347 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:52,365 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:52,367 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:52,368 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:25 [2020-12-23 17:15:52,435 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 17:15:52,437 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:52,448 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:52,449 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:52,450 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2020-12-23 17:15:52,492 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:52,493 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2020-12-23 17:15:52,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:15:52,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:52,498 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:52,515 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:52,516 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:52,517 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:38 [2020-12-23 17:15:52,587 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-12-23 17:15:52,589 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:52,610 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:52,611 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:52,612 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:50 [2020-12-23 17:15:52,806 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:52,806 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 99 [2020-12-23 17:15:52,809 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-12-23 17:15:52,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:15:52,811 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:52,831 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:52,833 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:15:52,833 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:63 [2020-12-23 17:15:53,146 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-12-23 17:15:53,150 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:53,151 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 210 [2020-12-23 17:15:53,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:15:53,155 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:15:53,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:15:53,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:15:53,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:15:53,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:15:53,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:15:53,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:15:53,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:15:53,166 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:15:53,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:15:53,169 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-12-23 17:15:53,169 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:15:53,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:15:53,173 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:53,220 INFO L625 ElimStorePlain]: treesize reduction 38, result has 71.2 percent of original size [2020-12-23 17:15:53,224 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:15:53,224 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:131, output treesize:67 [2020-12-23 17:15:53,433 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:53,433 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 66 treesize of output 41 [2020-12-23 17:15:53,436 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:15:53,450 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:53,454 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:15:53,454 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:77, output treesize:28 [2020-12-23 17:15:53,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:53,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:15:53,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2020-12-23 17:15:53,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285753318] [2020-12-23 17:15:53,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-12-23 17:15:53,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:15:53,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-12-23 17:15:53,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1253, Unknown=0, NotChecked=0, Total=1482 [2020-12-23 17:15:53,594 INFO L87 Difference]: Start difference. First operand 193 states and 210 transitions. Second operand 39 states. [2020-12-23 17:15:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:15:57,943 INFO L93 Difference]: Finished difference Result 280 states and 299 transitions. [2020-12-23 17:15:57,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-12-23 17:15:57,943 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2020-12-23 17:15:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:15:57,945 INFO L225 Difference]: With dead ends: 280 [2020-12-23 17:15:57,945 INFO L226 Difference]: Without dead ends: 280 [2020-12-23 17:15:57,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=715, Invalid=2945, Unknown=0, NotChecked=0, Total=3660 [2020-12-23 17:15:57,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-12-23 17:15:57,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 197. [2020-12-23 17:15:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-12-23 17:15:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 215 transitions. [2020-12-23 17:15:57,951 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 215 transitions. Word has length 38 [2020-12-23 17:15:57,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:15:57,951 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 215 transitions. [2020-12-23 17:15:57,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-12-23 17:15:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 215 transitions. [2020-12-23 17:15:57,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 17:15:57,952 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:15:57,952 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:15:58,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-12-23 17:15:58,154 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:15:58,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:15:58,155 INFO L82 PathProgramCache]: Analyzing trace with hash -882911829, now seen corresponding path program 1 times [2020-12-23 17:15:58,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:15:58,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032053532] [2020-12-23 17:15:58,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:15:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:58,852 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-12-23 17:15:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:15:59,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032053532] [2020-12-23 17:15:59,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80419381] [2020-12-23 17:15:59,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:15:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:15:59,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 56 conjunts are in the unsatisfiable core [2020-12-23 17:15:59,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:15:59,482 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:15:59,483 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:59,487 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:59,488 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:59,488 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:15:59,584 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_60|], 3=[|v_#valid_86|]} [2020-12-23 17:15:59,589 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:15:59,593 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:59,609 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:59,633 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:59,634 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-23 17:15:59,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:15:59,641 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:59,658 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:59,660 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:59,660 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2020-12-23 17:15:59,734 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:15:59,735 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:59,756 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:59,761 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:15:59,762 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:59,785 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:59,787 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:15:59,787 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2020-12-23 17:15:59,934 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2020-12-23 17:15:59,935 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:15:59,962 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:59,986 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:15:59,987 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 71 [2020-12-23 17:15:59,989 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-23 17:15:59,989 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:15:59,991 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-23 17:16:00,042 INFO L625 ElimStorePlain]: treesize reduction 47, result has 61.2 percent of original size [2020-12-23 17:16:00,044 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:00,044 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:74 [2020-12-23 17:16:00,344 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:00,345 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 40 treesize of output 63 [2020-12-23 17:16:00,347 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:00,429 INFO L625 ElimStorePlain]: treesize reduction 26, result has 79.4 percent of original size [2020-12-23 17:16:00,504 INFO L348 Elim1Store]: treesize reduction 52, result has 50.5 percent of original size [2020-12-23 17:16:00,505 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 85 treesize of output 91 [2020-12-23 17:16:00,509 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:00,542 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:00,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:00,545 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:00,546 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:00,547 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:113, output treesize:37 [2020-12-23 17:16:00,628 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 17:16:00,630 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:00,651 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:00,657 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 17:16:00,659 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:00,678 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:00,679 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:00,679 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:37 [2020-12-23 17:16:00,689 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_61|], 3=[|v_#valid_87|]} [2020-12-23 17:16:00,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:16:00,695 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-12-23 17:16:00,696 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:00,720 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:00,743 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:00,744 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-23 17:16:00,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:16:00,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:00,750 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:00,767 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:00,769 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:00,769 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2020-12-23 17:16:00,844 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-12-23 17:16:00,846 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:00,874 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:00,882 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-12-23 17:16:00,886 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:00,912 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:00,914 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:00,914 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:52 [2020-12-23 17:16:01,091 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_41|], 6=[|v_#memory_$Pointer$.base_60|]} [2020-12-23 17:16:01,097 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2020-12-23 17:16:01,099 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:01,122 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:01,171 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:01,171 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 108 [2020-12-23 17:16:01,175 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-12-23 17:16:01,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,179 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:01,201 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:01,202 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:01,203 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:78 [2020-12-23 17:16:01,416 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_42|], 12=[|v_#memory_$Pointer$.base_61|]} [2020-12-23 17:16:01,439 INFO L348 Elim1Store]: treesize reduction 41, result has 37.9 percent of original size [2020-12-23 17:16:01,439 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 39 [2020-12-23 17:16:01,441 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:01,479 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:01,585 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-12-23 17:16:01,585 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:01,586 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 225 [2020-12-23 17:16:01,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,593 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:16:01,594 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 17:16:01,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:16:01,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:16:01,599 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 1] term [2020-12-23 17:16:01,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-12-23 17:16:01,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:01,603 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-12-23 17:16:01,604 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 17:16:01,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,606 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,617 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,625 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,630 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 17:16:01,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,651 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,655 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-12-23 17:16:01,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,657 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,663 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:01,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,667 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:01,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,672 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,673 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,677 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,681 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 17:16:01,682 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 17:16:01,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,688 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:16:01,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:16:01,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:16:01,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:16:01,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,699 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,701 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,705 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,706 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 17:16:01,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,711 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,713 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,716 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,727 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,728 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,729 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,730 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-12-23 17:16:01,734 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-12-23 17:16:01,735 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-12-23 17:16:01,736 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,739 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,742 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,743 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:01,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:01,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,758 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,760 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-12-23 17:16:01,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,773 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:01,774 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:01,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,779 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,784 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,789 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-12-23 17:16:01,790 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-12-23 17:16:01,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:01,792 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,794 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,795 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-12-23 17:16:01,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:01,797 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:01,798 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:01,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:01,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,801 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,803 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,804 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,805 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:01,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:01,808 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,813 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,814 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,816 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-12-23 17:16:01,817 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 17:16:01,818 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,818 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,819 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,820 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,821 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,823 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,825 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,826 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,830 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,831 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,835 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,835 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:01,840 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,844 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-12-23 17:16:01,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,849 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,850 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,854 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:01,857 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:01,858 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,861 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,863 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:01,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,868 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:01,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:01,922 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 17 xjuncts. [2020-12-23 17:16:02,622 WARN L197 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 43 [2020-12-23 17:16:02,624 INFO L625 ElimStorePlain]: treesize reduction 8126, result has 2.1 percent of original size [2020-12-23 17:16:02,629 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:02,630 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:193, output treesize:168 [2020-12-23 17:16:02,890 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2020-12-23 17:16:02,894 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 17:16:02,895 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:02,922 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:02,931 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:02,931 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 66 treesize of output 41 [2020-12-23 17:16:02,935 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:02,952 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:02,954 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. [2020-12-23 17:16:02,955 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:86, output treesize:18 [2020-12-23 17:16:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:16:03,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:16:03,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2020-12-23 17:16:03,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360507174] [2020-12-23 17:16:03,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-12-23 17:16:03,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:16:03,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-12-23 17:16:03,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1252, Unknown=0, NotChecked=0, Total=1406 [2020-12-23 17:16:03,110 INFO L87 Difference]: Start difference. First operand 197 states and 215 transitions. Second operand 38 states. [2020-12-23 17:16:04,021 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2020-12-23 17:16:04,196 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2020-12-23 17:16:04,389 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2020-12-23 17:16:04,581 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 43 [2020-12-23 17:16:04,734 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2020-12-23 17:16:04,979 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2020-12-23 17:16:05,350 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2020-12-23 17:16:06,004 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2020-12-23 17:16:06,508 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 41 [2020-12-23 17:16:06,798 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 43 [2020-12-23 17:16:07,072 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 54 [2020-12-23 17:16:07,322 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 52 [2020-12-23 17:16:07,686 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 70 [2020-12-23 17:16:07,985 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 47 [2020-12-23 17:16:08,581 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 44 [2020-12-23 17:16:09,192 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 49 [2020-12-23 17:16:11,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:16:11,830 INFO L93 Difference]: Finished difference Result 339 states and 355 transitions. [2020-12-23 17:16:11,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2020-12-23 17:16:11,831 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2020-12-23 17:16:11,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:16:11,833 INFO L225 Difference]: With dead ends: 339 [2020-12-23 17:16:11,834 INFO L226 Difference]: Without dead ends: 339 [2020-12-23 17:16:11,836 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1612 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=974, Invalid=5032, Unknown=0, NotChecked=0, Total=6006 [2020-12-23 17:16:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2020-12-23 17:16:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 202. [2020-12-23 17:16:11,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-12-23 17:16:11,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 220 transitions. [2020-12-23 17:16:11,842 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 220 transitions. Word has length 38 [2020-12-23 17:16:11,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:16:11,843 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 220 transitions. [2020-12-23 17:16:11,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-12-23 17:16:11,843 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 220 transitions. [2020-12-23 17:16:11,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 17:16:11,843 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:16:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:16:12,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:16:12,058 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:16:12,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:16:12,059 INFO L82 PathProgramCache]: Analyzing trace with hash 434187832, now seen corresponding path program 1 times [2020-12-23 17:16:12,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:16:12,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523196822] [2020-12-23 17:16:12,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:16:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:16:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:16:12,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523196822] [2020-12-23 17:16:12,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:16:12,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 17:16:12,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461919738] [2020-12-23 17:16:12,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 17:16:12,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:16:12,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 17:16:12,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 17:16:12,149 INFO L87 Difference]: Start difference. First operand 202 states and 220 transitions. Second operand 8 states. [2020-12-23 17:16:12,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:16:12,571 INFO L93 Difference]: Finished difference Result 229 states and 240 transitions. [2020-12-23 17:16:12,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 17:16:12,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2020-12-23 17:16:12,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:16:12,573 INFO L225 Difference]: With dead ends: 229 [2020-12-23 17:16:12,576 INFO L226 Difference]: Without dead ends: 229 [2020-12-23 17:16:12,577 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-23 17:16:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-12-23 17:16:12,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 209. [2020-12-23 17:16:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-12-23 17:16:12,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 229 transitions. [2020-12-23 17:16:12,583 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 229 transitions. Word has length 39 [2020-12-23 17:16:12,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:16:12,583 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 229 transitions. [2020-12-23 17:16:12,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 17:16:12,583 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 229 transitions. [2020-12-23 17:16:12,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 17:16:12,584 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:16:12,584 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:16:12,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 17:16:12,584 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:16:12,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:16:12,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1258442498, now seen corresponding path program 1 times [2020-12-23 17:16:12,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:16:12,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067404105] [2020-12-23 17:16:12,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:16:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:16:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:16:12,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067404105] [2020-12-23 17:16:12,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938240635] [2020-12-23 17:16:12,829 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 [2020-12-23 17:16:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:16:12,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 35 conjunts are in the unsatisfiable core [2020-12-23 17:16:12,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:16:12,938 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:16:12,943 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:12,948 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:12,949 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:12,949 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:16:13,029 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:13,029 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 17:16:13,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:13,032 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:13,041 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:13,042 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:13,042 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2020-12-23 17:16:13,076 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:16:13,077 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:13,096 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:13,101 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:16:13,102 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:13,120 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:13,121 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:13,121 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2020-12-23 17:16:13,228 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:13,228 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 65 [2020-12-23 17:16:13,230 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-12-23 17:16:13,231 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:16:13,233 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-23 17:16:13,282 INFO L625 ElimStorePlain]: treesize reduction 41, result has 59.0 percent of original size [2020-12-23 17:16:13,287 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2020-12-23 17:16:13,288 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:13,307 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:13,309 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:13,309 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2020-12-23 17:16:13,382 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:13,383 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 42 treesize of output 37 [2020-12-23 17:16:13,384 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:13,394 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:13,395 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:13,396 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:24 [2020-12-23 17:16:13,462 INFO L348 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2020-12-23 17:16:13,462 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 36 treesize of output 31 [2020-12-23 17:16:13,464 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:13,479 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:13,483 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:13,483 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:11 [2020-12-23 17:16:13,648 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 17:16:13,650 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:13,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:13,658 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:13,658 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2020-12-23 17:16:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:16:13,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:16:13,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2020-12-23 17:16:13,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329654496] [2020-12-23 17:16:13,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-12-23 17:16:13,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:16:13,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-12-23 17:16:13,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2020-12-23 17:16:13,754 INFO L87 Difference]: Start difference. First operand 209 states and 229 transitions. Second operand 29 states. [2020-12-23 17:16:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:16:15,734 INFO L93 Difference]: Finished difference Result 254 states and 269 transitions. [2020-12-23 17:16:15,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-23 17:16:15,735 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 40 [2020-12-23 17:16:15,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:16:15,737 INFO L225 Difference]: With dead ends: 254 [2020-12-23 17:16:15,737 INFO L226 Difference]: Without dead ends: 254 [2020-12-23 17:16:15,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=611, Invalid=1839, Unknown=0, NotChecked=0, Total=2450 [2020-12-23 17:16:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-12-23 17:16:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 221. [2020-12-23 17:16:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-12-23 17:16:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 245 transitions. [2020-12-23 17:16:15,743 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 245 transitions. Word has length 40 [2020-12-23 17:16:15,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:16:15,744 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 245 transitions. [2020-12-23 17:16:15,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-12-23 17:16:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 245 transitions. [2020-12-23 17:16:15,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 17:16:15,744 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:16:15,745 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:16:15,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2020-12-23 17:16:15,958 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:16:15,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:16:15,959 INFO L82 PathProgramCache]: Analyzing trace with hash 48023564, now seen corresponding path program 1 times [2020-12-23 17:16:15,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:16:15,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64374878] [2020-12-23 17:16:15,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:16:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:16:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:16:16,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64374878] [2020-12-23 17:16:16,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522588480] [2020-12-23 17:16:16,563 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 [2020-12-23 17:16:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:16:16,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 41 conjunts are in the unsatisfiable core [2020-12-23 17:16:16,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:16:16,680 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:16:16,681 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:16,683 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:16,684 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:16,684 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-23 17:16:16,719 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 17:16:16,720 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:16,726 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:16,727 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:16,728 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-12-23 17:16:16,834 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:16,834 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-23 17:16:16,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:16,840 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:16,854 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:16,855 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:16,856 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2020-12-23 17:16:16,910 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_64|], 2=[|v_#memory_int_37|]} [2020-12-23 17:16:16,916 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:16:16,917 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:16,940 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:16,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:16:16,948 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-12-23 17:16:16,952 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:16,971 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:16,975 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:16,976 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:38 [2020-12-23 17:16:17,125 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:17,126 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 70 treesize of output 76 [2020-12-23 17:16:17,128 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-23 17:16:17,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:16:17,130 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-23 17:16:17,187 INFO L625 ElimStorePlain]: treesize reduction 52, result has 61.2 percent of original size [2020-12-23 17:16:17,192 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2020-12-23 17:16:17,198 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:17,218 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:17,220 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:17,220 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:51 [2020-12-23 17:16:17,328 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:17,329 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2020-12-23 17:16:17,334 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:17,347 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:17,349 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:17,349 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:24 [2020-12-23 17:16:17,445 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-12-23 17:16:17,446 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:17,460 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:17,461 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:17,461 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2020-12-23 17:16:17,531 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2020-12-23 17:16:17,533 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:17,545 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:17,546 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:17,546 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:33 [2020-12-23 17:16:17,612 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:17,613 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-23 17:16:17,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:16:17,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:17,617 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:17,629 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:17,630 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:17,630 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2020-12-23 17:16:17,684 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_66|], 6=[|v_#memory_int_41|]} [2020-12-23 17:16:17,689 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:16:17,690 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:17,710 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:17,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:16:17,715 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2020-12-23 17:16:17,717 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:17,732 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:17,734 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:17,734 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:39 [2020-12-23 17:16:17,855 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_67|], 6=[|v_#memory_int_42|]} [2020-12-23 17:16:17,879 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:17,880 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 75 [2020-12-23 17:16:17,883 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-23 17:16:17,883 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:16:17,884 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:17,908 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:17,914 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2020-12-23 17:16:17,916 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:17,932 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:17,934 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:17,934 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:91, output treesize:52 [2020-12-23 17:16:18,041 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:18,041 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 32 [2020-12-23 17:16:18,043 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:18,057 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:18,059 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:18,060 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:31 [2020-12-23 17:16:18,151 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2020-12-23 17:16:18,152 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:18,170 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:18,175 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:18,176 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2020-12-23 17:16:18,395 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2020-12-23 17:16:18,398 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:18,407 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:18,408 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:18,409 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2020-12-23 17:16:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:16:18,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:16:18,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 38 [2020-12-23 17:16:18,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260454360] [2020-12-23 17:16:18,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-12-23 17:16:18,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:16:18,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-12-23 17:16:18,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2020-12-23 17:16:18,467 INFO L87 Difference]: Start difference. First operand 221 states and 245 transitions. Second operand 38 states. [2020-12-23 17:16:21,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:16:21,675 INFO L93 Difference]: Finished difference Result 297 states and 319 transitions. [2020-12-23 17:16:21,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-12-23 17:16:21,676 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 40 [2020-12-23 17:16:21,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:16:21,678 INFO L225 Difference]: With dead ends: 297 [2020-12-23 17:16:21,678 INFO L226 Difference]: Without dead ends: 297 [2020-12-23 17:16:21,680 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=693, Invalid=3339, Unknown=0, NotChecked=0, Total=4032 [2020-12-23 17:16:21,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-12-23 17:16:21,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 215. [2020-12-23 17:16:21,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-12-23 17:16:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 238 transitions. [2020-12-23 17:16:21,686 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 238 transitions. Word has length 40 [2020-12-23 17:16:21,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:16:21,686 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 238 transitions. [2020-12-23 17:16:21,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-12-23 17:16:21,687 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 238 transitions. [2020-12-23 17:16:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-23 17:16:21,687 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:16:21,688 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:16:21,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:16:21,902 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:16:21,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:16:21,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1551524264, now seen corresponding path program 1 times [2020-12-23 17:16:21,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:16:21,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34436361] [2020-12-23 17:16:21,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:16:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:16:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:16:22,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34436361] [2020-12-23 17:16:22,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:16:22,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 17:16:22,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571051427] [2020-12-23 17:16:22,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 17:16:22,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:16:22,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 17:16:22,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-12-23 17:16:22,109 INFO L87 Difference]: Start difference. First operand 215 states and 238 transitions. Second operand 13 states. [2020-12-23 17:16:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:16:22,768 INFO L93 Difference]: Finished difference Result 233 states and 252 transitions. [2020-12-23 17:16:22,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 17:16:22,769 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2020-12-23 17:16:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:16:22,770 INFO L225 Difference]: With dead ends: 233 [2020-12-23 17:16:22,771 INFO L226 Difference]: Without dead ends: 233 [2020-12-23 17:16:22,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2020-12-23 17:16:22,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-12-23 17:16:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 219. [2020-12-23 17:16:22,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-12-23 17:16:22,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 242 transitions. [2020-12-23 17:16:22,776 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 242 transitions. Word has length 42 [2020-12-23 17:16:22,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:16:22,777 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 242 transitions. [2020-12-23 17:16:22,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 17:16:22,777 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 242 transitions. [2020-12-23 17:16:22,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-23 17:16:22,777 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:16:22,778 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, 1, 1, 1] [2020-12-23 17:16:22,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 17:16:22,778 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 17:16:22,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:16:22,779 INFO L82 PathProgramCache]: Analyzing trace with hash -957442866, now seen corresponding path program 1 times [2020-12-23 17:16:22,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:16:22,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321936624] [2020-12-23 17:16:22,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:16:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:16:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:16:23,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321936624] [2020-12-23 17:16:23,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030507077] [2020-12-23 17:16:23,745 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 [2020-12-23 17:16:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:16:23,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 65 conjunts are in the unsatisfiable core [2020-12-23 17:16:23,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:16:23,862 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:16:23,863 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:23,870 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:23,871 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:23,872 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 17:16:23,933 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_62|], 3=[|v_#valid_94|]} [2020-12-23 17:16:23,937 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 17:16:23,938 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:23,958 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:23,985 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:23,985 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-12-23 17:16:23,987 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:23,989 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:24,010 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:24,011 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:24,011 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2020-12-23 17:16:24,092 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:16:24,093 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:24,114 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:24,119 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 17:16:24,120 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:24,139 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:24,141 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:16:24,141 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2020-12-23 17:16:24,302 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2020-12-23 17:16:24,304 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:24,337 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:24,369 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:24,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 61 treesize of output 71 [2020-12-23 17:16:24,372 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-23 17:16:24,372 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:24,374 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-23 17:16:24,445 INFO L625 ElimStorePlain]: treesize reduction 47, result has 64.7 percent of original size [2020-12-23 17:16:24,448 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:24,448 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:102, output treesize:86 [2020-12-23 17:16:24,755 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-12-23 17:16:24,757 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:24,806 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:24,903 INFO L348 Elim1Store]: treesize reduction 52, result has 50.5 percent of original size [2020-12-23 17:16:24,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, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 80 [2020-12-23 17:16:24,911 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:24,954 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:24,978 INFO L348 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2020-12-23 17:16:24,979 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 43 treesize of output 34 [2020-12-23 17:16:24,985 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:25,022 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:25,024 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:25,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:25,026 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:25,026 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:132, output treesize:77 [2020-12-23 17:16:25,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:25,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:25,118 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:25,119 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:25,194 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:25,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:25,283 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:25,284 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:25,364 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:25,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:25,448 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:16:25,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:25,451 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:25,451 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:25,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:25,454 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:25,454 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:25,455 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:25,462 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_44|], 6=[|v_#memory_$Pointer$.base_71|, |v_#memory_$Pointer$.offset_49|]} [2020-12-23 17:16:25,472 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 13 treesize of output 9 [2020-12-23 17:16:25,473 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:25,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 13 treesize of output 9 [2020-12-23 17:16:25,483 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:25,711 WARN L197 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2020-12-23 17:16:25,712 INFO L625 ElimStorePlain]: treesize reduction 3, result has 98.6 percent of original size [2020-12-23 17:16:25,755 INFO L348 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2020-12-23 17:16:25,755 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 36 treesize of output 31 [2020-12-23 17:16:25,758 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:25,768 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-12-23 17:16:25,770 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:25,962 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-12-23 17:16:25,963 INFO L625 ElimStorePlain]: treesize reduction 6, result has 96.6 percent of original size [2020-12-23 17:16:25,998 INFO L348 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2020-12-23 17:16:25,999 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 43 treesize of output 34 [2020-12-23 17:16:26,001 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:26,008 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 36 treesize of output 16 [2020-12-23 17:16:26,009 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:26,161 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-12-23 17:16:26,162 INFO L625 ElimStorePlain]: treesize reduction 6, result has 95.3 percent of original size [2020-12-23 17:16:26,165 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-12-23 17:16:26,165 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:217, output treesize:122 [2020-12-23 17:16:26,317 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:26,355 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:26,356 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-23 17:16:26,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:16:26,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:26,361 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:26,384 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:26,385 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-23 17:16:26,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:16:26,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:26,389 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:26,469 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:26,472 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 2 xjuncts. [2020-12-23 17:16:26,472 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:118 [2020-12-23 17:16:26,625 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_45|], 6=[|v_#memory_$Pointer$.offset_50|, |v_#memory_$Pointer$.base_72|]} [2020-12-23 17:16:26,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:16:26,634 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-12-23 17:16:26,635 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:26,696 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:26,721 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:26,721 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 52 [2020-12-23 17:16:26,724 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:26,853 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2020-12-23 17:16:26,854 INFO L625 ElimStorePlain]: treesize reduction 16, result has 85.6 percent of original size [2020-12-23 17:16:26,879 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:26,879 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 52 [2020-12-23 17:16:26,881 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:27,002 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2020-12-23 17:16:27,004 INFO L625 ElimStorePlain]: treesize reduction 16, result has 85.8 percent of original size [2020-12-23 17:16:27,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:27,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:27,008 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:27,009 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:108, output treesize:91 [2020-12-23 17:16:27,010 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:27,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:27,222 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_51|, |v_#memory_int_46|], 6=[|v_#memory_$Pointer$.base_73|]} [2020-12-23 17:16:27,227 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2020-12-23 17:16:27,229 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:27,270 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:27,289 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2020-12-23 17:16:27,291 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:27,322 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:27,375 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:27,376 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 58 treesize of output 103 [2020-12-23 17:16:27,379 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-12-23 17:16:27,379 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:27,382 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:27,412 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:27,413 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:27,414 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:126, output treesize:79 [2020-12-23 17:16:27,621 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_47|], 6=[|v_#memory_$Pointer$.offset_52|], 12=[|v_#memory_$Pointer$.base_74|]} [2020-12-23 17:16:27,628 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2020-12-23 17:16:27,629 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:27,670 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:27,694 INFO L348 Elim1Store]: treesize reduction 41, result has 37.9 percent of original size [2020-12-23 17:16:27,695 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 39 [2020-12-23 17:16:27,696 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:27,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:27,849 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-12-23 17:16:27,850 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:27,850 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 233 [2020-12-23 17:16:27,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:27,857 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 17:16:27,858 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:27,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:27,860 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:16:27,861 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:16:27,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:16:27,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:16:27,866 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 1] term [2020-12-23 17:16:27,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:27,868 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-12-23 17:16:27,868 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:27,869 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-12-23 17:16:27,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:27,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:27,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:27,872 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:27,873 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:27,874 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:27,875 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:27,876 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:27,877 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:27,878 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 17:16:27,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:27,879 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:27,880 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 17:16:27,881 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:27,881 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:27,882 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:27,884 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-12-23 17:16:27,884 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:27,885 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:27,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:27,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:16:27,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:27,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:27,889 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:27,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-12-23 17:16:27,891 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-12-23 17:16:27,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:27,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:27,894 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 17:16:27,894 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:27,895 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 17:16:27,905 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2020-12-23 17:16:28,168 WARN L197 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2020-12-23 17:16:28,169 INFO L625 ElimStorePlain]: treesize reduction 2623, result has 6.9 percent of original size [2020-12-23 17:16:28,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:16:28,178 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:28,179 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:219, output treesize:190 [2020-12-23 17:16:28,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:16:28,325 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:16:35,907 WARN L197 SmtUtils]: Spent 7.47 s on a formula simplification that was a NOOP. DAG size: 55 [2020-12-23 17:16:36,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:36,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:36,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:36,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:16:36,795 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:16:36,808 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:16:36,838 INFO L443 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 12=[|#memory_$Pointer$.base|]} [2020-12-23 17:16:36,846 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 17:16:36,847 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:36,854 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2020-12-23 17:16:36,856 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:16:37,004 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-12-23 17:16:37,005 INFO L625 ElimStorePlain]: treesize reduction 16, result has 92.0 percent of original size [2020-12-23 17:16:37,016 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:16:37,040 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:37,041 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 75 [2020-12-23 17:16:37,044 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:37,051 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:16:37,058 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:37,058 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 66 treesize of output 41 [2020-12-23 17:16:37,061 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:16:37,124 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:16:37,128 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2020-12-23 17:16:37,128 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:239, output treesize:65 [2020-12-23 17:16:59,578 WARN L197 SmtUtils]: Spent 21.61 s on a formula simplification that was a NOOP. DAG size: 49 [2020-12-23 17:17:29,816 WARN L197 SmtUtils]: Spent 22.96 s on a formula simplification that was a NOOP. DAG size: 49 [2020-12-23 17:17:29,820 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-12-23 17:17:29,820 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:17:29,833 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:17:29,834 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2020-12-23 17:17:29,836 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:29,866 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:29,870 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 17:17:29,871 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2020-12-23 17:17:29,873 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:17:29,897 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:17:29,901 INFO L547 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:17:29,901 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:73, output treesize:3 [2020-12-23 17:17:29,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:17:29,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:17:29,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2020-12-23 17:17:29,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173376427] [2020-12-23 17:17:29,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 43 states [2020-12-23 17:17:29,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:17:29,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2020-12-23 17:17:29,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1635, Unknown=7, NotChecked=0, Total=1806 [2020-12-23 17:17:29,986 INFO L87 Difference]: Start difference. First operand 219 states and 242 transitions. Second operand 43 states. [2020-12-23 17:17:38,624 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2020-12-23 17:17:40,526 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2020-12-23 17:17:40,795 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2020-12-23 17:17:41,570 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2020-12-23 17:17:41,943 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2020-12-23 17:17:50,445 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2020-12-23 17:17:56,731 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2020-12-23 17:18:00,950 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2020-12-23 17:18:05,241 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 55 [2020-12-23 17:18:09,611 WARN L197 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 145 DAG size of output: 81 [2020-12-23 17:18:17,848 WARN L197 SmtUtils]: Spent 8.12 s on a formula simplification. DAG size of input: 106 DAG size of output: 59