/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/forester-heap/dll-rb-cnstr_1-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 16:13:32,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 16:13:32,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 16:13:32,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 16:13:32,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 16:13:32,442 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 16:13:32,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 16:13:32,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 16:13:32,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 16:13:32,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 16:13:32,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 16:13:32,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 16:13:32,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 16:13:32,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 16:13:32,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 16:13:32,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 16:13:32,462 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 16:13:32,463 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 16:13:32,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 16:13:32,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 16:13:32,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 16:13:32,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 16:13:32,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 16:13:32,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 16:13:32,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 16:13:32,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 16:13:32,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 16:13:32,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 16:13:32,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 16:13:32,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 16:13:32,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 16:13:32,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 16:13:32,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 16:13:32,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 16:13:32,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 16:13:32,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 16:13:32,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 16:13:32,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 16:13:32,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 16:13:32,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 16:13:32,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 16:13:32,518 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:13:32,548 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 16:13:32,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 16:13:32,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 16:13:32,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 16:13:32,550 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 16:13:32,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 16:13:32,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 16:13:32,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 16:13:32,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 16:13:32,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 16:13:32,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 16:13:32,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 16:13:32,553 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 16:13:32,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 16:13:32,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 16:13:32,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 16:13:32,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 16:13:32,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:13:32,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 16:13:32,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 16:13:32,555 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 16:13:32,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 16:13:32,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 16:13:32,556 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 16:13:32,556 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 16:13:32,557 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:13:32,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 16:13:32,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 16:13:32,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 16:13:32,985 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 16:13:32,985 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 16:13:32,987 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-01-06 16:13:33,090 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/47bf29e10/5ce9de271e3c403e8d439233d1e5d7b1/FLAG3826ed5e3 [2021-01-06 16:13:33,858 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 16:13:33,859 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-01-06 16:13:33,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/47bf29e10/5ce9de271e3c403e8d439233d1e5d7b1/FLAG3826ed5e3 [2021-01-06 16:13:34,150 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/47bf29e10/5ce9de271e3c403e8d439233d1e5d7b1 [2021-01-06 16:13:34,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 16:13:34,158 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 16:13:34,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 16:13:34,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 16:13:34,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 16:13:34,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:13:34" (1/1) ... [2021-01-06 16:13:34,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60ee841f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:34, skipping insertion in model container [2021-01-06 16:13:34,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:13:34" (1/1) ... [2021-01-06 16:13:34,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 16:13:34,245 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],StructAccessExpression[IdentifierExpression[~list~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem6,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem10,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem10,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] [2021-01-06 16:13:34,560 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2021-01-06 16:13:34,565 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] [2021-01-06 16:13:34,567 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~list~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~list~0,] [2021-01-06 16:13:34,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:13:34,589 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],StructAccessExpression[IdentifierExpression[~list~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem6,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem10,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem10,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] [2021-01-06 16:13:34,686 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2021-01-06 16:13:34,688 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] [2021-01-06 16:13:34,690 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~list~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~list~0,] [2021-01-06 16:13:34,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:13:34,759 INFO L208 MainTranslator]: Completed translation [2021-01-06 16:13:34,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:34 WrapperNode [2021-01-06 16:13:34,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 16:13:34,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 16:13:34,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 16:13:34,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 16:13:34,794 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:13:34" (1/1) ... [2021-01-06 16:13:34,837 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:13:34" (1/1) ... [2021-01-06 16:13:34,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 16:13:34,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 16:13:34,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 16:13:34,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 16:13:34,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:34" (1/1) ... [2021-01-06 16:13:34,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:34" (1/1) ... [2021-01-06 16:13:34,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:34" (1/1) ... [2021-01-06 16:13:34,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:34" (1/1) ... [2021-01-06 16:13:34,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:34" (1/1) ... [2021-01-06 16:13:34,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:34" (1/1) ... [2021-01-06 16:13:34,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:34" (1/1) ... [2021-01-06 16:13:34,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 16:13:34,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 16:13:34,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 16:13:34,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 16:13:34,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:34" (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:13:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 16:13:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 16:13:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 16:13:35,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 16:13:35,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 16:13:35,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 16:13:35,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 16:13:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 16:13:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 16:13:35,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 16:13:35,710 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 16:13:35,711 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2021-01-06 16:13:35,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:13:35 BoogieIcfgContainer [2021-01-06 16:13:35,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 16:13:35,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 16:13:35,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 16:13:35,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 16:13:35,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 04:13:34" (1/3) ... [2021-01-06 16:13:35,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfe87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:13:35, skipping insertion in model container [2021-01-06 16:13:35,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:13:34" (2/3) ... [2021-01-06 16:13:35,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfe87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:13:35, skipping insertion in model container [2021-01-06 16:13:35,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:13:35" (3/3) ... [2021-01-06 16:13:35,723 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2021-01-06 16:13:35,730 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 16:13:35,738 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2021-01-06 16:13:35,765 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-01-06 16:13:35,794 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 16:13:35,794 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 16:13:35,794 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 16:13:35,794 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 16:13:35,794 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 16:13:35,795 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 16:13:35,795 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 16:13:35,795 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 16:13:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2021-01-06 16:13:35,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-01-06 16:13:35,818 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:35,819 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-01-06 16:13:35,819 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:35,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:35,826 INFO L82 PathProgramCache]: Analyzing trace with hash 889968582, now seen corresponding path program 1 times [2021-01-06 16:13:35,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:35,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38786737] [2021-01-06 16:13:35,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:36,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38786737] [2021-01-06 16:13:36,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:36,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 16:13:36,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780166662] [2021-01-06 16:13:36,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 16:13:36,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:36,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 16:13:36,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 16:13:36,046 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2021-01-06 16:13:36,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:36,066 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions. [2021-01-06 16:13:36,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 16:13:36,068 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2021-01-06 16:13:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:36,078 INFO L225 Difference]: With dead ends: 53 [2021-01-06 16:13:36,078 INFO L226 Difference]: Without dead ends: 23 [2021-01-06 16:13:36,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 16:13:36,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-01-06 16:13:36,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-01-06 16:13:36,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2021-01-06 16:13:36,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2021-01-06 16:13:36,122 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 6 [2021-01-06 16:13:36,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:36,122 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2021-01-06 16:13:36,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 16:13:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2021-01-06 16:13:36,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-01-06 16:13:36,123 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:36,123 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:36,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 16:13:36,124 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:36,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:36,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1806853233, now seen corresponding path program 1 times [2021-01-06 16:13:36,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:36,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634653459] [2021-01-06 16:13:36,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:36,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634653459] [2021-01-06 16:13:36,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:36,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 16:13:36,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45918306] [2021-01-06 16:13:36,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 16:13:36,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:36,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 16:13:36,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:13:36,217 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 4 states. [2021-01-06 16:13:36,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:36,308 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2021-01-06 16:13:36,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 16:13:36,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2021-01-06 16:13:36,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:36,310 INFO L225 Difference]: With dead ends: 31 [2021-01-06 16:13:36,310 INFO L226 Difference]: Without dead ends: 29 [2021-01-06 16:13:36,314 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:13:36,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-01-06 16:13:36,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2021-01-06 16:13:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-01-06 16:13:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2021-01-06 16:13:36,320 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 7 [2021-01-06 16:13:36,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:36,321 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2021-01-06 16:13:36,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 16:13:36,322 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2021-01-06 16:13:36,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-06 16:13:36,323 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:36,323 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:36,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 16:13:36,325 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:36,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:36,326 INFO L82 PathProgramCache]: Analyzing trace with hash -856511048, now seen corresponding path program 1 times [2021-01-06 16:13:36,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:36,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589902553] [2021-01-06 16:13:36,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:36,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:36,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589902553] [2021-01-06 16:13:36,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:36,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:13:36,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114631681] [2021-01-06 16:13:36,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:13:36,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:36,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:13:36,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:13:36,496 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states. [2021-01-06 16:13:36,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:36,683 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2021-01-06 16:13:36,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 16:13:36,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2021-01-06 16:13:36,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:36,686 INFO L225 Difference]: With dead ends: 47 [2021-01-06 16:13:36,687 INFO L226 Difference]: Without dead ends: 45 [2021-01-06 16:13:36,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:13:36,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-01-06 16:13:36,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2021-01-06 16:13:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2021-01-06 16:13:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-01-06 16:13:36,703 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2021-01-06 16:13:36,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:36,704 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-01-06 16:13:36,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:13:36,704 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-01-06 16:13:36,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-06 16:13:36,705 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:36,705 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:36,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 16:13:36,706 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:36,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:36,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1594081566, now seen corresponding path program 1 times [2021-01-06 16:13:36,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:36,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823445012] [2021-01-06 16:13:36,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:37,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823445012] [2021-01-06 16:13:37,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634143489] [2021-01-06 16:13:37,028 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:13:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:37,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 28 conjunts are in the unsatisfiable core [2021-01-06 16:13:37,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:13:37,280 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-06 16:13:37,284 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:37,299 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:37,307 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 16:13:37,310 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:37,320 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:37,324 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:13:37,325 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:21 [2021-01-06 16:13:37,540 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:37,541 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-06 16:13:37,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:13:37,553 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:37,600 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:37,616 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:13:37,659 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:37,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:37,677 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 20 [2021-01-06 16:13:37,680 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:37,708 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:37,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:37,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:37,721 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-01-06 16:13:37,724 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:37,745 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:37,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:37,752 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:37,767 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:37,772 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:13:37,772 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:111, output treesize:24 [2021-01-06 16:13:37,857 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:37,858 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2021-01-06 16:13:37,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:13:37,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:13:37,867 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:37,935 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:37,944 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_31|, |v_#memory_int_32|, |v_#memory_int_33|, |v_#memory_$Pointer$.base_23|], 4=[|v_#memory_int_35|]} [2021-01-06 16:13:37,954 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:13:38,010 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:38,016 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:13:38,055 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:38,065 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:13:38,100 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:38,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:38,106 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:38,129 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:38,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:38,209 INFO L348 Elim1Store]: treesize reduction 65, result has 46.7 percent of original size [2021-01-06 16:13:38,210 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 85 [2021-01-06 16:13:38,215 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:38,274 INFO L625 ElimStorePlain]: treesize reduction 16, result has 82.2 percent of original size [2021-01-06 16:13:38,300 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-01-06 16:13:38,301 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:246, output treesize:40 [2021-01-06 16:13:38,498 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2021-01-06 16:13:38,502 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:38,508 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:38,511 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:13:38,511 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2021-01-06 16:13:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:38,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:13:38,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-01-06 16:13:38,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338621501] [2021-01-06 16:13:38,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 16:13:38,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:38,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 16:13:38,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-01-06 16:13:38,518 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 10 states. [2021-01-06 16:13:41,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:41,303 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2021-01-06 16:13:41,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 16:13:41,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2021-01-06 16:13:41,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:41,305 INFO L225 Difference]: With dead ends: 60 [2021-01-06 16:13:41,305 INFO L226 Difference]: Without dead ends: 58 [2021-01-06 16:13:41,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-01-06 16:13:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-01-06 16:13:41,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 19. [2021-01-06 16:13:41,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-01-06 16:13:41,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2021-01-06 16:13:41,312 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2021-01-06 16:13:41,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:41,313 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2021-01-06 16:13:41,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 16:13:41,313 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2021-01-06 16:13:41,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 16:13:41,314 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:41,314 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:41,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:13:41,528 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:41,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:41,530 INFO L82 PathProgramCache]: Analyzing trace with hash -839217458, now seen corresponding path program 1 times [2021-01-06 16:13:41,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:41,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780595146] [2021-01-06 16:13:41,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:41,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:13:41,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780595146] [2021-01-06 16:13:41,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:13:41,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:13:41,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731911860] [2021-01-06 16:13:41,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:13:41,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:41,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:13:41,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:13:41,697 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 5 states. [2021-01-06 16:13:41,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:41,806 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2021-01-06 16:13:41,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:13:41,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2021-01-06 16:13:41,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:41,807 INFO L225 Difference]: With dead ends: 35 [2021-01-06 16:13:41,807 INFO L226 Difference]: Without dead ends: 27 [2021-01-06 16:13:41,809 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:13:41,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-01-06 16:13:41,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2021-01-06 16:13:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-01-06 16:13:41,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2021-01-06 16:13:41,817 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2021-01-06 16:13:41,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:41,817 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2021-01-06 16:13:41,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:13:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2021-01-06 16:13:41,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 16:13:41,818 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:41,818 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:41,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 16:13:41,818 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:41,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:41,819 INFO L82 PathProgramCache]: Analyzing trace with hash -839157876, now seen corresponding path program 1 times [2021-01-06 16:13:41,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:41,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154612320] [2021-01-06 16:13:41,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 16:13:41,850 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 16:13:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 16:13:41,871 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 16:13:41,905 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 16:13:41,906 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 16:13:41,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 16:13:41,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 04:13:41 BoogieIcfgContainer [2021-01-06 16:13:41,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 16:13:41,952 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 16:13:41,952 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 16:13:41,953 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 16:13:41,953 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:13:35" (3/4) ... [2021-01-06 16:13:41,956 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 16:13:42,002 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/forester-heap/dll-rb-cnstr_1-2.i-witness.graphml [2021-01-06 16:13:42,003 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 16:13:42,004 INFO L168 Benchmark]: Toolchain (without parser) took 7846.58 ms. Allocated memory was 160.4 MB in the beginning and 192.9 MB in the end (delta: 32.5 MB). Free memory was 134.4 MB in the beginning and 151.9 MB in the end (delta: -17.5 MB). Peak memory consumption was 16.0 MB. Max. memory is 8.0 GB. [2021-01-06 16:13:42,005 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 160.4 MB. Free memory is still 134.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 16:13:42,005 INFO L168 Benchmark]: CACSL2BoogieTranslator took 599.47 ms. Allocated memory is still 160.4 MB. Free memory was 134.0 MB in the beginning and 111.4 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2021-01-06 16:13:42,006 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.34 ms. Allocated memory is still 160.4 MB. Free memory was 111.4 MB in the beginning and 141.7 MB in the end (delta: -30.3 MB). Peak memory consumption was 2.6 MB. Max. memory is 8.0 GB. [2021-01-06 16:13:42,007 INFO L168 Benchmark]: Boogie Preprocessor took 76.08 ms. Allocated memory is still 160.4 MB. Free memory was 141.7 MB in the beginning and 140.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-06 16:13:42,008 INFO L168 Benchmark]: RCFGBuilder took 752.86 ms. Allocated memory is still 160.4 MB. Free memory was 140.1 MB in the beginning and 116.0 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:13:42,008 INFO L168 Benchmark]: TraceAbstraction took 6236.93 ms. Allocated memory was 160.4 MB in the beginning and 192.9 MB in the end (delta: 32.5 MB). Free memory was 115.5 MB in the beginning and 154.0 MB in the end (delta: -38.5 MB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 16:13:42,009 INFO L168 Benchmark]: Witness Printer took 50.52 ms. Allocated memory is still 192.9 MB. Free memory was 154.0 MB in the beginning and 151.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:13:42,015 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 160.4 MB. Free memory is still 134.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 599.47 ms. Allocated memory is still 160.4 MB. Free memory was 134.0 MB in the beginning and 111.4 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 119.34 ms. Allocated memory is still 160.4 MB. Free memory was 111.4 MB in the beginning and 141.7 MB in the end (delta: -30.3 MB). Peak memory consumption was 2.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 76.08 ms. Allocated memory is still 160.4 MB. Free memory was 141.7 MB in the beginning and 140.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 752.86 ms. Allocated memory is still 160.4 MB. Free memory was 140.1 MB in the beginning and 116.0 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 6236.93 ms. Allocated memory was 160.4 MB in the beginning and 192.9 MB in the end (delta: 32.5 MB). Free memory was 115.5 MB in the beginning and 154.0 MB in the end (delta: -38.5 MB). There was no memory consumed. Max. memory is 8.0 GB. * Witness Printer took 50.52 ms. Allocated memory is still 192.9 MB. Free memory was 154.0 MB in the beginning and 151.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1051]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1005] SLL* list = malloc(sizeof(SLL)); [L1006] list->next = ((void*)0) [L1007] list->prev = ((void*)0) [L1008] list->colour = BLACK [L1010] SLL* end = list; [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1036] end = ((void*)0) [L1037] end = list [L1040] COND FALSE !(!(((void*)0) != end)) [L1041] EXPR end->colour [L1041] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE ((void*)0) != end [L1045] EXPR end->colour [L1045] COND FALSE !(RED == end->colour) [L1051] EXPR end->next [L1051] COND TRUE !(end->next) [L1051] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.1s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 123 SDtfs, 148 SDslu, 195 SDs, 0 SdLazy, 213 SolverSat, 41 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 70 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 58 ConstructedInterpolants, 6 QuantifiedInterpolants, 6780 SizeOfPredicates, 12 NumberOfNonLiveVariables, 104 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 0/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...