/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-178dd20 [2021-01-06 16:07:17,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 16:07:17,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 16:07:17,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 16:07:17,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 16:07:17,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 16:07:17,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 16:07:17,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 16:07:17,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 16:07:17,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 16:07:17,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 16:07:17,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 16:07:17,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 16:07:17,803 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 16:07:17,804 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 16:07:17,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 16:07:17,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 16:07:17,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 16:07:17,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 16:07:17,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 16:07:17,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 16:07:17,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 16:07:17,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 16:07:17,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 16:07:17,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 16:07:17,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 16:07:17,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 16:07:17,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 16:07:17,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 16:07:17,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 16:07:17,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 16:07:17,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 16:07:17,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 16:07:17,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 16:07:17,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 16:07:17,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 16:07:17,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 16:07:17,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 16:07:17,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 16:07:17,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 16:07:17,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 16:07:17,882 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 16:07:17,938 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 16:07:17,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 16:07:17,943 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 16:07:17,944 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 16:07:17,944 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 16:07:17,944 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 16:07:17,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 16:07:17,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 16:07:17,945 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 16:07:17,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 16:07:17,945 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 16:07:17,946 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 16:07:17,946 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 16:07:17,947 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 16:07:17,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 16:07:17,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 16:07:17,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 16:07:17,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:07:17,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 16:07:17,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 16:07:17,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 16:07:17,949 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 16:07:17,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 16:07:17,949 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 16:07:17,949 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 16:07:17,950 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 16:07:18,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 16:07:18,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 16:07:18,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 16:07:18,486 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 16:07:18,486 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 16:07:18,487 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 [2021-01-06 16:07:18,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/94e0330ea/4e2a71ce03f949e19177cc8771a4a99d/FLAGefda83718 [2021-01-06 16:07:19,301 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 16:07:19,302 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2021-01-06 16:07:19,329 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/94e0330ea/4e2a71ce03f949e19177cc8771a4a99d/FLAGefda83718 [2021-01-06 16:07:19,582 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/94e0330ea/4e2a71ce03f949e19177cc8771a4a99d [2021-01-06 16:07:19,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 16:07:19,589 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 16:07:19,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 16:07:19,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 16:07:19,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 16:07:19,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:07:19" (1/1) ... [2021-01-06 16:07:19,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ed479b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:19, skipping insertion in model container [2021-01-06 16:07:19,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:07:19" (1/1) ... [2021-01-06 16:07:19,614 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 16:07:19,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 16:07:20,147 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,] [2021-01-06 16:07:20,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:07:20,258 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 16:07:20,323 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,] [2021-01-06 16:07:20,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:07:20,430 INFO L208 MainTranslator]: Completed translation [2021-01-06 16:07:20,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20 WrapperNode [2021-01-06 16:07:20,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 16:07:20,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 16:07:20,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 16:07:20,432 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 16:07:20,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (1/1) ... [2021-01-06 16:07:20,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (1/1) ... [2021-01-06 16:07:20,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 16:07:20,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 16:07:20,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 16:07:20,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 16:07:20,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (1/1) ... [2021-01-06 16:07:20,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (1/1) ... [2021-01-06 16:07:20,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (1/1) ... [2021-01-06 16:07:20,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (1/1) ... [2021-01-06 16:07:20,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (1/1) ... [2021-01-06 16:07:20,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (1/1) ... [2021-01-06 16:07:20,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (1/1) ... [2021-01-06 16:07:20,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 16:07:20,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 16:07:20,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 16:07:20,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 16:07:20,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:07:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 16:07:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2021-01-06 16:07:20,817 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2021-01-06 16:07:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 16:07:20,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 16:07:20,818 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-01-06 16:07:20,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-01-06 16:07:20,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 16:07:20,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 16:07:20,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-06 16:07:20,819 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2021-01-06 16:07:20,819 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2021-01-06 16:07:20,819 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2021-01-06 16:07:20,819 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2021-01-06 16:07:20,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 16:07:20,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 16:07:20,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 16:07:21,667 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 16:07:21,668 INFO L299 CfgBuilder]: Removed 148 assume(true) statements. [2021-01-06 16:07:21,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:07:21 BoogieIcfgContainer [2021-01-06 16:07:21,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 16:07:21,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 16:07:21,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 16:07:21,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 16:07:21,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 04:07:19" (1/3) ... [2021-01-06 16:07:21,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26de3da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:07:21, skipping insertion in model container [2021-01-06 16:07:21,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (2/3) ... [2021-01-06 16:07:21,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26de3da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:07:21, skipping insertion in model container [2021-01-06 16:07:21,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:07:21" (3/3) ... [2021-01-06 16:07:21,681 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2021-01-06 16:07:21,688 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 16:07:21,694 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 26 error locations. [2021-01-06 16:07:21,715 INFO L253 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2021-01-06 16:07:21,746 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 16:07:21,746 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 16:07:21,747 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 16:07:21,747 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 16:07:21,747 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 16:07:21,747 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 16:07:21,747 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 16:07:21,747 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 16:07:21,776 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states. [2021-01-06 16:07:21,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-06 16:07:21,784 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:07:21,785 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] [2021-01-06 16:07:21,786 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]=== [2021-01-06 16:07:21,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:07:21,797 INFO L82 PathProgramCache]: Analyzing trace with hash 235077082, now seen corresponding path program 1 times [2021-01-06 16:07:21,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:07:21,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775838954] [2021-01-06 16:07:21,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:07:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:22,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 16:07:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:22,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 16:07:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:22,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-01-06 16:07:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 16:07:22,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775838954] [2021-01-06 16:07:22,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:07:22,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:07:22,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393881944] [2021-01-06 16:07:22,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:07:22,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:07:22,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:07:22,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:07:22,290 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 3 states. [2021-01-06 16:07:22,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:07:22,592 INFO L93 Difference]: Finished difference Result 387 states and 611 transitions. [2021-01-06 16:07:22,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:07:22,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2021-01-06 16:07:22,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:07:22,610 INFO L225 Difference]: With dead ends: 387 [2021-01-06 16:07:22,611 INFO L226 Difference]: Without dead ends: 189 [2021-01-06 16:07:22,616 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 [2021-01-06 16:07:22,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-01-06 16:07:22,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-01-06 16:07:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2021-01-06 16:07:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 205 transitions. [2021-01-06 16:07:22,677 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 205 transitions. Word has length 32 [2021-01-06 16:07:22,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:07:22,678 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 205 transitions. [2021-01-06 16:07:22,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:07:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2021-01-06 16:07:22,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-06 16:07:22,681 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:07:22,681 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] [2021-01-06 16:07:22,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 16:07:22,682 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]=== [2021-01-06 16:07:22,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:07:22,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1381037844, now seen corresponding path program 1 times [2021-01-06 16:07:22,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:07:22,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063042429] [2021-01-06 16:07:22,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:07:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:22,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 16:07:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:22,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 16:07:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:23,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-01-06 16:07:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 16:07:23,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063042429] [2021-01-06 16:07:23,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76945719] [2021-01-06 16:07:23,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:07:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:23,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-06 16:07:23,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:07:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 16:07:23,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 16:07:23,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2021-01-06 16:07:23,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376449158] [2021-01-06 16:07:23,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:07:23,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:07:23,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:07:23,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-06 16:07:23,380 INFO L87 Difference]: Start difference. First operand 189 states and 205 transitions. Second operand 5 states. [2021-01-06 16:07:23,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:07:23,499 INFO L93 Difference]: Finished difference Result 388 states and 436 transitions. [2021-01-06 16:07:23,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 16:07:23,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2021-01-06 16:07:23,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:07:23,503 INFO L225 Difference]: With dead ends: 388 [2021-01-06 16:07:23,503 INFO L226 Difference]: Without dead ends: 202 [2021-01-06 16:07:23,505 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 [2021-01-06 16:07:23,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-01-06 16:07:23,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2021-01-06 16:07:23,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2021-01-06 16:07:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 220 transitions. [2021-01-06 16:07:23,534 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 220 transitions. Word has length 33 [2021-01-06 16:07:23,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:07:23,535 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 220 transitions. [2021-01-06 16:07:23,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:07:23,535 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 220 transitions. [2021-01-06 16:07:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-01-06 16:07:23,543 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:07:23,543 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] [2021-01-06 16:07:23,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-01-06 16:07:23,745 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]=== [2021-01-06 16:07:23,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:07:23,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1343163818, now seen corresponding path program 1 times [2021-01-06 16:07:23,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:07:23,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652796833] [2021-01-06 16:07:23,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:07:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:23,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 16:07:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 16:07:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 16:07:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-01-06 16:07:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-01-06 16:07:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 16:07:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-01-06 16:07:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-01-06 16:07:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 16:07:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-01-06 16:07:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-01-06 16:07:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 16:07:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-01-06 16:07:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 10 proven. 48 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-01-06 16:07:25,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652796833] [2021-01-06 16:07:25,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272786385] [2021-01-06 16:07:25,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:07:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:25,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 73 conjunts are in the unsatisfiable core [2021-01-06 16:07:25,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:07:25,482 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 [2021-01-06 16:07:25,484 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:07:25,494 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:07:25,499 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 [2021-01-06 16:07:25,501 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:07:25,508 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:07:25,510 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:07:25,511 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2021-01-06 16:07:27,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:07:27,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:07:39,615 WARN L197 SmtUtils]: Spent 7.61 s on a formula simplification that was a NOOP. DAG size: 55 [2021-01-06 16:07:39,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:07:39,650 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2021-01-06 16:07:39,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:07:41,750 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 [2021-01-06 16:07:41,817 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:07:41,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:07:41,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:07:42,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:07:42,024 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:07:42,027 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 16:07:42,028 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 16:07:42,033 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-01-06 16:07:42,034 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:07:42,036 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:07:42,036 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_BEFORE_CALL_2| vanished before elimination [2021-01-06 16:07:42,037 INFO L547 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:07:42,037 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:1075, output treesize:1 [2021-01-06 16:07:42,123 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-01-06 16:07:42,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 16:07:42,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 20 [2021-01-06 16:07:42,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874187960] [2021-01-06 16:07:42,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 16:07:42,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:07:42,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 16:07:42,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=4, NotChecked=34, Total=380 [2021-01-06 16:07:42,126 INFO L87 Difference]: Start difference. First operand 202 states and 220 transitions. Second operand 10 states. [2021-01-06 16:08:03,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:08:03,078 INFO L93 Difference]: Finished difference Result 402 states and 445 transitions. [2021-01-06 16:08:03,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 16:08:03,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2021-01-06 16:08:03,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:08:03,081 INFO L225 Difference]: With dead ends: 402 [2021-01-06 16:08:03,081 INFO L226 Difference]: Without dead ends: 205 [2021-01-06 16:08:03,083 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=4, NotChecked=38, Total=462 [2021-01-06 16:08:03,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-01-06 16:08:03,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2021-01-06 16:08:03,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2021-01-06 16:08:03,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 224 transitions. [2021-01-06 16:08:03,120 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 224 transitions. Word has length 103 [2021-01-06 16:08:03,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:08:03,120 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 224 transitions. [2021-01-06 16:08:03,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 16:08:03,121 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 224 transitions. [2021-01-06 16:08:03,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-01-06 16:08:03,123 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:08:03,123 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] [2021-01-06 16:08:03,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:08:03,338 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]=== [2021-01-06 16:08:03,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:08:03,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1499598614, now seen corresponding path program 1 times [2021-01-06 16:08:03,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:08:03,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564194067] [2021-01-06 16:08:03,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:08:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:03,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 16:08:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:03,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 16:08:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:03,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 16:08:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:04,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-01-06 16:08:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:04,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-01-06 16:08:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:04,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 16:08:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:04,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-01-06 16:08:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:04,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-01-06 16:08:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:04,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 16:08:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:04,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-01-06 16:08:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:04,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-01-06 16:08:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:04,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 16:08:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:04,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-01-06 16:08:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-01-06 16:08:04,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564194067] [2021-01-06 16:08:04,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499571198] [2021-01-06 16:08:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:08:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:04,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 42 conjunts are in the unsatisfiable core [2021-01-06 16:08:04,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:08:04,891 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:08:04,891 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 [2021-01-06 16:08:04,893 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:08:04,938 INFO L625 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2021-01-06 16:08:04,946 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:08:04,946 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:8 [2021-01-06 16:08:05,096 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 [2021-01-06 16:08:05,098 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:08:05,100 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:08:05,101 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:08:05,101 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2021-01-06 16:08:05,171 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-01-06 16:08:05,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:08:05,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2021-01-06 16:08:05,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757975216] [2021-01-06 16:08:05,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-01-06 16:08:05,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:08:05,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-01-06 16:08:05,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2021-01-06 16:08:05,174 INFO L87 Difference]: Start difference. First operand 205 states and 224 transitions. Second operand 22 states. [2021-01-06 16:08:05,997 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2021-01-06 16:08:06,549 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2021-01-06 16:08:08,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:08:08,425 INFO L93 Difference]: Finished difference Result 427 states and 468 transitions. [2021-01-06 16:08:08,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-01-06 16:08:08,428 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 103 [2021-01-06 16:08:08,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:08:08,430 INFO L225 Difference]: With dead ends: 427 [2021-01-06 16:08:08,430 INFO L226 Difference]: Without dead ends: 217 [2021-01-06 16:08:08,435 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=162, Invalid=1320, Unknown=0, NotChecked=0, Total=1482 [2021-01-06 16:08:08,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-01-06 16:08:08,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-01-06 16:08:08,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2021-01-06 16:08:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 237 transitions. [2021-01-06 16:08:08,471 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 237 transitions. Word has length 103 [2021-01-06 16:08:08,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:08:08,472 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 237 transitions. [2021-01-06 16:08:08,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-01-06 16:08:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 237 transitions. [2021-01-06 16:08:08,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-06 16:08:08,474 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:08:08,475 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] [2021-01-06 16:08:08,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:08:08,689 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]=== [2021-01-06 16:08:08,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:08:08,689 INFO L82 PathProgramCache]: Analyzing trace with hash 974363944, now seen corresponding path program 1 times [2021-01-06 16:08:08,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:08:08,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930740436] [2021-01-06 16:08:08,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:08:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:09,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 16:08:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:09,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 16:08:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:09,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 16:08:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:10,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-01-06 16:08:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:10,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-01-06 16:08:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:08:11,677 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 32 [2021-01-06 16:08:47,529 WARN L197 SmtUtils]: Spent 35.77 s on a formula simplification. DAG size of input: 364 DAG size of output: 13743