/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-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 06:12:56,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 06:12:56,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 06:12:57,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 06:12:57,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 06:12:57,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 06:12:57,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 06:12:57,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 06:12:57,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 06:12:57,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 06:12:57,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 06:12:57,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 06:12:57,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 06:12:57,093 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 06:12:57,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 06:12:57,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 06:12:57,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 06:12:57,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 06:12:57,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 06:12:57,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 06:12:57,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 06:12:57,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 06:12:57,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 06:12:57,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 06:12:57,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 06:12:57,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 06:12:57,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 06:12:57,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 06:12:57,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 06:12:57,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 06:12:57,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 06:12:57,134 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 06:12:57,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 06:12:57,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 06:12:57,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 06:12:57,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 06:12:57,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 06:12:57,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 06:12:57,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 06:12:57,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 06:12:57,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 06:12:57,142 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 06:12:57,171 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 06:12:57,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 06:12:57,173 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 06:12:57,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 06:12:57,174 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 06:12:57,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 06:12:57,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 06:12:57,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 06:12:57,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 06:12:57,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 06:12:57,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 06:12:57,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 06:12:57,175 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 06:12:57,176 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 06:12:57,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 06:12:57,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 06:12:57,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 06:12:57,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 06:12:57,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 06:12:57,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 06:12:57,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 06:12:57,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 06:12:57,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 06:12:57,178 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 06:12:57,178 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 06:12:57,178 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 06:12:57,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 06:12:57,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 06:12:57,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 06:12:57,672 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 06:12:57,673 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 06:12:57,674 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2020-12-23 06:12:57,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d0169bb97/fed356f12ec64782ae75cfcbd1e72f9d/FLAGb3157b15e [2020-12-23 06:12:58,514 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 06:12:58,515 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2020-12-23 06:12:58,545 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d0169bb97/fed356f12ec64782ae75cfcbd1e72f9d/FLAGb3157b15e [2020-12-23 06:12:58,819 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d0169bb97/fed356f12ec64782ae75cfcbd1e72f9d [2020-12-23 06:12:58,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 06:12:58,824 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 06:12:58,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 06:12:58,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 06:12:58,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 06:12:58,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 06:12:58" (1/1) ... [2020-12-23 06:12:58,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a304c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:12:58, skipping insertion in model container [2020-12-23 06:12:58,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 06:12:58" (1/1) ... [2020-12-23 06:12:58,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 06:12:58,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 06:12:59,242 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/heap-manipulation/dll_of_dll-2.i[22634,22647] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ptr~0,],base],StructAccessExpression[IdentifierExpression[~ptr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ptr~0,],base],StructAccessExpression[IdentifierExpression[~ptr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ptr~1,],base],StructAccessExpression[IdentifierExpression[~ptr~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ptr~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~ptr~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ptr~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~ptr~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~item~0,],base],StructAccessExpression[IdentifierExpression[~item~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~next~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~next~0,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~dll,] left hand side expression in assignment: lhs: VariableLHS[~dll,] left hand side expression in assignment: lhs: VariableLHS[~dll,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dll,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~dll,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~dll,] left hand side expression in assignment: lhs: VariableLHS[~dll,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~item~1,],base],StructAccessExpression[IdentifierExpression[~item~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~next~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~next~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~item~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~item~1,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~dll,] left hand side expression in assignment: lhs: VariableLHS[~dll,] left hand side expression in assignment: lhs: VariableLHS[~dll,] left hand side expression in assignment: lhs: VariableLHS[~dll,] left hand side expression in assignment: lhs: VariableLHS[~pos~0,] left hand side expression in assignment: lhs: VariableLHS[~pos~0,] left hand side expression in assignment: lhs: VariableLHS[~dll,] left hand side expression in assignment: lhs: VariableLHS[~dll,] [2020-12-23 06:12:59,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 06:12:59,330 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 06:12:59,406 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/heap-manipulation/dll_of_dll-2.i[22634,22647] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ptr~0,],base],StructAccessExpression[IdentifierExpression[~ptr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ptr~0,],base],StructAccessExpression[IdentifierExpression[~ptr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ptr~1,],base],StructAccessExpression[IdentifierExpression[~ptr~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ptr~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~ptr~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ptr~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~ptr~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~item~0,],base],StructAccessExpression[IdentifierExpression[~item~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~next~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~next~0,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~dll,] left hand side expression in assignment: lhs: VariableLHS[~dll,] left hand side expression in assignment: lhs: VariableLHS[~dll,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dll,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~dll,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~dll,] left hand side expression in assignment: lhs: VariableLHS[~dll,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~item~1,],base],StructAccessExpression[IdentifierExpression[~item~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~next~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~next~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~item~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~item~1,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~dll,] left hand side expression in assignment: lhs: VariableLHS[~dll,] left hand side expression in assignment: lhs: VariableLHS[~dll,] left hand side expression in assignment: lhs: VariableLHS[~dll,] left hand side expression in assignment: lhs: VariableLHS[~pos~0,] left hand side expression in assignment: lhs: VariableLHS[~pos~0,] left hand side expression in assignment: lhs: VariableLHS[~dll,] left hand side expression in assignment: lhs: VariableLHS[~dll,] [2020-12-23 06:12:59,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 06:12:59,560 INFO L208 MainTranslator]: Completed translation [2020-12-23 06:12:59,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:12:59 WrapperNode [2020-12-23 06:12:59,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 06:12:59,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 06:12:59,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 06:12:59,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 06:12:59,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:12:59" (1/1) ... [2020-12-23 06:12:59,643 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:12:59" (1/1) ... [2020-12-23 06:12:59,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 06:12:59,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 06:12:59,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 06:12:59,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 06:12:59,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:12:59" (1/1) ... [2020-12-23 06:12:59,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:12:59" (1/1) ... [2020-12-23 06:12:59,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:12:59" (1/1) ... [2020-12-23 06:12:59,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:12:59" (1/1) ... [2020-12-23 06:12:59,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:12:59" (1/1) ... [2020-12-23 06:12:59,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:12:59" (1/1) ... [2020-12-23 06:12:59,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:12:59" (1/1) ... [2020-12-23 06:12:59,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 06:12:59,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 06:12:59,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 06:12:59,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 06:12:59,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:12:59" (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 06:12:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 06:12:59,876 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2020-12-23 06:12:59,876 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2020-12-23 06:12:59,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 06:12:59,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 06:12:59,876 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2020-12-23 06:12:59,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2020-12-23 06:12:59,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 06:12:59,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 06:12:59,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-23 06:12:59,879 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2020-12-23 06:12:59,882 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2020-12-23 06:12:59,882 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2020-12-23 06:12:59,883 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2020-12-23 06:12:59,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 06:12:59,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 06:12:59,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 06:13:00,741 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 06:13:00,742 INFO L299 CfgBuilder]: Removed 148 assume(true) statements. [2020-12-23 06:13:00,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:13:00 BoogieIcfgContainer [2020-12-23 06:13:00,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 06:13:00,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 06:13:00,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 06:13:00,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 06:13:00,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 06:12:58" (1/3) ... [2020-12-23 06:13:00,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61bf2150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 06:13:00, skipping insertion in model container [2020-12-23 06:13:00,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:12:59" (2/3) ... [2020-12-23 06:13:00,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61bf2150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 06:13:00, skipping insertion in model container [2020-12-23 06:13:00,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:13:00" (3/3) ... [2020-12-23 06:13:00,754 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2020-12-23 06:13:00,762 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 06:13:00,769 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 26 error locations. [2020-12-23 06:13:00,792 INFO L253 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2020-12-23 06:13:00,823 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 06:13:00,823 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 06:13:00,824 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 06:13:00,824 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 06:13:00,824 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 06:13:00,824 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 06:13:00,825 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 06:13:00,825 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 06:13:00,854 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states. [2020-12-23 06:13:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-23 06:13:00,863 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:13:00,864 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:13:00,865 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:13:00,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:13:00,872 INFO L82 PathProgramCache]: Analyzing trace with hash 235077082, now seen corresponding path program 1 times [2020-12-23 06:13:00,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:13:00,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013437161] [2020-12-23 06:13:00,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:13:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:01,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 06:13:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:01,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-23 06:13:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:01,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-12-23 06:13:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 06:13:01,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013437161] [2020-12-23 06:13:01,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:13:01,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 06:13:01,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575011848] [2020-12-23 06:13:01,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 06:13:01,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:13:01,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 06:13:01,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 06:13:01,335 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 3 states. [2020-12-23 06:13:01,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:13:01,562 INFO L93 Difference]: Finished difference Result 387 states and 611 transitions. [2020-12-23 06:13:01,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 06:13:01,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2020-12-23 06:13:01,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:13:01,578 INFO L225 Difference]: With dead ends: 387 [2020-12-23 06:13:01,578 INFO L226 Difference]: Without dead ends: 189 [2020-12-23 06:13:01,583 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 06:13:01,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-12-23 06:13:01,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2020-12-23 06:13:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-12-23 06:13:01,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 205 transitions. [2020-12-23 06:13:01,648 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 205 transitions. Word has length 32 [2020-12-23 06:13:01,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:13:01,648 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 205 transitions. [2020-12-23 06:13:01,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 06:13:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2020-12-23 06:13:01,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-23 06:13:01,651 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:13:01,651 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:13:01,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 06:13:01,655 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:13:01,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:13:01,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1381037844, now seen corresponding path program 1 times [2020-12-23 06:13:01,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:13:01,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673032638] [2020-12-23 06:13:01,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:13:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:01,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 06:13:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:01,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-23 06:13:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:01,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-12-23 06:13:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:02,033 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 06:13:02,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673032638] [2020-12-23 06:13:02,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292303925] [2020-12-23 06:13:02,035 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 06:13:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:02,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-23 06:13:02,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:13:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 06:13:02,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 06:13:02,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2020-12-23 06:13:02,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035813112] [2020-12-23 06:13:02,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 06:13:02,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:13:02,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 06:13:02,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-23 06:13:02,291 INFO L87 Difference]: Start difference. First operand 189 states and 205 transitions. Second operand 5 states. [2020-12-23 06:13:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:13:02,401 INFO L93 Difference]: Finished difference Result 388 states and 436 transitions. [2020-12-23 06:13:02,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 06:13:02,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-12-23 06:13:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:13:02,405 INFO L225 Difference]: With dead ends: 388 [2020-12-23 06:13:02,405 INFO L226 Difference]: Without dead ends: 202 [2020-12-23 06:13:02,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-12-23 06:13:02,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-12-23 06:13:02,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2020-12-23 06:13:02,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-12-23 06:13:02,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 220 transitions. [2020-12-23 06:13:02,429 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 220 transitions. Word has length 33 [2020-12-23 06:13:02,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:13:02,429 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 220 transitions. [2020-12-23 06:13:02,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 06:13:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 220 transitions. [2020-12-23 06:13:02,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-23 06:13:02,433 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:13:02,433 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:13:02,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-23 06:13:02,651 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:13:02,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:13:02,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1343163818, now seen corresponding path program 1 times [2020-12-23 06:13:02,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:13:02,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100466410] [2020-12-23 06:13:02,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:13:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:02,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 06:13:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:03,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-23 06:13:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:03,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 06:13:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:03,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-23 06:13:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:03,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-23 06:13:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:03,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-23 06:13:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:03,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-12-23 06:13:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:03,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-12-23 06:13:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:03,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 06:13:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:03,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-23 06:13:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:03,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-23 06:13:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:03,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-23 06:13:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:03,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-12-23 06:13:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:03,962 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 10 proven. 48 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-12-23 06:13:03,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100466410] [2020-12-23 06:13:03,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741411404] [2020-12-23 06:13:03,964 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 06:13:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:04,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 73 conjunts are in the unsatisfiable core [2020-12-23 06:13:04,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:13:04,343 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 7 treesize of output 3 [2020-12-23 06:13:04,345 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:13:04,353 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:13:04,356 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 7 treesize of output 3 [2020-12-23 06:13:04,358 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:13:04,363 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:13:04,365 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 06:13:04,366 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2020-12-23 06:13:06,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:13:06,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 06:13:21,282 WARN L197 SmtUtils]: Spent 10.33 s on a formula simplification that was a NOOP. DAG size: 55 [2020-12-23 06:13:21,308 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:13:21,342 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-12-23 06:13:21,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:13:23,467 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.offset| Int) (|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0.base| Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base| Int) (|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0.offset| Int)) (let ((.cse4 (store |c_old(#memory_$Pointer$.offset)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base| (store (select |c_old(#memory_$Pointer$.offset)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base|) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.offset| 0)))) (let ((.cse8 (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base| (store (select |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base|) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.offset| 0))) (.cse5 (select (select .cse4 |c_##fun~$Pointer$~TO~VOID_#in~12.base|) |c_##fun~$Pointer$~TO~VOID_#in~12.offset|))) (let ((.cse3 (+ .cse5 8)) (.cse2 (select (select .cse8 |c_##fun~$Pointer$~TO~VOID_#in~12.base|) |c_##fun~$Pointer$~TO~VOID_#in~12.offset|))) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (let ((.cse0 (let ((.cse1 (store .cse4 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0.base| (store (select .cse4 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0.base|) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0.offset| .cse5)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0.offset|))))) (store .cse0 |c_##fun~$Pointer$~TO~VOID_#in~12.base| (store (select .cse0 |c_##fun~$Pointer$~TO~VOID_#in~12.base|) |c_##fun~$Pointer$~TO~VOID_#in~12.offset| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0.offset|)))) (= (let ((.cse6 (let ((.cse7 (store .cse8 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0.base| (store (select .cse8 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0.base|) |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0.offset| .cse2)))) (store .cse7 .cse2 (store (select .cse7 .cse2) .cse3 |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0.base|))))) (store .cse6 |c_##fun~$Pointer$~TO~VOID_#in~12.base| (store (select .cse6 |c_##fun~$Pointer$~TO~VOID_#in~12.base|) |c_##fun~$Pointer$~TO~VOID_#in~12.offset| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0.base|))) |c_#memory_$Pointer$.base|) (<= |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0.base| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base|) (not (= .cse5 0))))))) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (let ((.cse13 (store |c_old(#memory_$Pointer$.offset)| v_prenex_3 (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_3) v_prenex_1 0)))) (let ((.cse17 (store |c_old(#memory_$Pointer$.base)| v_prenex_3 (store (select |c_old(#memory_$Pointer$.base)| v_prenex_3) v_prenex_1 0))) (.cse14 (select (select .cse13 |c_##fun~$Pointer$~TO~VOID_#in~12.base|) |c_##fun~$Pointer$~TO~VOID_#in~12.offset|))) (let ((.cse12 (+ .cse14 8)) (.cse11 (select (select .cse17 |c_##fun~$Pointer$~TO~VOID_#in~12.base|) |c_##fun~$Pointer$~TO~VOID_#in~12.offset|))) (and (< v_prenex_3 |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (let ((.cse9 (let ((.cse10 (store .cse13 v_prenex_2 (store (select .cse13 v_prenex_2) v_prenex_4 .cse14)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_prenex_4))))) (store .cse9 |c_##fun~$Pointer$~TO~VOID_#in~12.base| (store (select .cse9 |c_##fun~$Pointer$~TO~VOID_#in~12.base|) |c_##fun~$Pointer$~TO~VOID_#in~12.offset| v_prenex_4)))) (<= v_prenex_2 v_prenex_3) (= (let ((.cse15 (let ((.cse16 (store .cse17 v_prenex_2 (store (select .cse17 v_prenex_2) v_prenex_4 .cse11)))) (store .cse16 .cse11 (store (select .cse16 .cse11) .cse12 v_prenex_2))))) (store .cse15 |c_##fun~$Pointer$~TO~VOID_#in~12.base| (store (select .cse15 |c_##fun~$Pointer$~TO~VOID_#in~12.base|) |c_##fun~$Pointer$~TO~VOID_#in~12.offset| v_prenex_2))) |c_#memory_$Pointer$.base|) (not (= .cse11 0)))))))) is different from true [2020-12-23 06:13:23,545 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:13:23,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 06:13:23,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 06:13:23,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 06:13:23,698 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:13:23,702 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 06:13:23,703 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 06:13:23,708 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-23 06:13:23,709 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 06:13:23,711 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:13:23,712 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_BEFORE_CALL_2| vanished before elimination [2020-12-23 06:13:23,712 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 06:13:23,712 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:1075, output treesize:1 [2020-12-23 06:13:23,821 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2020-12-23 06:13:23,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 06:13:23,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 20 [2020-12-23 06:13:23,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021603268] [2020-12-23 06:13:23,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 06:13:23,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:13:23,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 06:13:23,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=4, NotChecked=34, Total=380 [2020-12-23 06:13:23,831 INFO L87 Difference]: Start difference. First operand 202 states and 220 transitions. Second operand 10 states. [2020-12-23 06:13:43,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:13:43,437 INFO L93 Difference]: Finished difference Result 402 states and 445 transitions. [2020-12-23 06:13:43,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 06:13:43,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2020-12-23 06:13:43,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:13:43,443 INFO L225 Difference]: With dead ends: 402 [2020-12-23 06:13:43,444 INFO L226 Difference]: Without dead ends: 205 [2020-12-23 06:13:43,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=4, NotChecked=38, Total=462 [2020-12-23 06:13:43,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-12-23 06:13:43,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2020-12-23 06:13:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-12-23 06:13:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 224 transitions. [2020-12-23 06:13:43,464 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 224 transitions. Word has length 103 [2020-12-23 06:13:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:13:43,464 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 224 transitions. [2020-12-23 06:13:43,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 06:13:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 224 transitions. [2020-12-23 06:13:43,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-23 06:13:43,470 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:13:43,471 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:13:43,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:13:43,686 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:13:43,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:13:43,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1499598614, now seen corresponding path program 1 times [2020-12-23 06:13:43,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:13:43,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353258522] [2020-12-23 06:13:43,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:13:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:43,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 06:13:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:43,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-23 06:13:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:44,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 06:13:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:44,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-23 06:13:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:44,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-23 06:13:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:44,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-23 06:13:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:44,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-12-23 06:13:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:44,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-12-23 06:13:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:44,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 06:13:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:44,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-23 06:13:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:44,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-23 06:13:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:44,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-23 06:13:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:44,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-12-23 06:13:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:44,821 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-12-23 06:13:44,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353258522] [2020-12-23 06:13:44,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123703235] [2020-12-23 06:13:44,822 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 06:13:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:45,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 42 conjunts are in the unsatisfiable core [2020-12-23 06:13:45,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 06:13:45,569 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:13:45,570 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 1 case distinctions, treesize of input 31 treesize of output 47 [2020-12-23 06:13:45,573 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:13:45,639 INFO L625 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2020-12-23 06:13:45,645 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 06:13:45,646 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:8 [2020-12-23 06:13:45,828 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 16 treesize of output 8 [2020-12-23 06:13:45,829 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 06:13:45,833 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 06:13:45,834 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 06:13:45,834 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2020-12-23 06:13:45,914 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2020-12-23 06:13:45,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 06:13:45,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2020-12-23 06:13:45,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489047211] [2020-12-23 06:13:45,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-23 06:13:45,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:13:45,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-23 06:13:45,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2020-12-23 06:13:45,918 INFO L87 Difference]: Start difference. First operand 205 states and 224 transitions. Second operand 22 states. [2020-12-23 06:13:46,650 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-12-23 06:13:46,897 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2020-12-23 06:13:47,370 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-12-23 06:13:47,621 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2020-12-23 06:13:48,769 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-12-23 06:13:49,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:13:49,912 INFO L93 Difference]: Finished difference Result 427 states and 468 transitions. [2020-12-23 06:13:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-23 06:13:49,920 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 103 [2020-12-23 06:13:49,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:13:49,922 INFO L225 Difference]: With dead ends: 427 [2020-12-23 06:13:49,922 INFO L226 Difference]: Without dead ends: 217 [2020-12-23 06:13:49,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=162, Invalid=1320, Unknown=0, NotChecked=0, Total=1482 [2020-12-23 06:13:49,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-12-23 06:13:49,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2020-12-23 06:13:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-12-23 06:13:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 237 transitions. [2020-12-23 06:13:49,964 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 237 transitions. Word has length 103 [2020-12-23 06:13:49,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:13:49,964 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 237 transitions. [2020-12-23 06:13:49,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-23 06:13:49,965 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 237 transitions. [2020-12-23 06:13:49,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 06:13:49,972 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:13:49,972 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:13:50,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 06:13:50,178 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:13:50,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:13:50,178 INFO L82 PathProgramCache]: Analyzing trace with hash 974363944, now seen corresponding path program 1 times [2020-12-23 06:13:50,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:13:50,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644274470] [2020-12-23 06:13:50,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:13:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:50,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 06:13:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:51,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-23 06:13:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:51,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 06:13:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:51,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-12-23 06:13:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:51,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-12-23 06:13:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:13:53,118 WARN L197 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 32 [2020-12-23 06:14:28,083 WARN L197 SmtUtils]: Spent 34.89 s on a formula simplification. DAG size of input: 364 DAG size of output: 13743