./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1da26dc017449c0cb12d610e89da82d7cad61026 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1da26dc017449c0cb12d610e89da82d7cad61026 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_18 term size 50 --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:54:29,747 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:54:29,750 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:54:29,762 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:54:29,763 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:54:29,765 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:54:29,768 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:54:29,770 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:54:29,772 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:54:29,774 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:54:29,777 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:54:29,777 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:54:29,779 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:54:29,781 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:54:29,784 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:54:29,790 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:54:29,791 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:54:29,793 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:54:29,797 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:54:29,798 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:54:29,799 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:54:29,800 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:54:29,805 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:54:29,805 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:54:29,805 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:54:29,806 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:54:29,807 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:54:29,808 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:54:29,808 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:54:29,812 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:54:29,812 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:54:29,813 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:54:29,813 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:54:29,813 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:54:29,814 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:54:29,814 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:54:29,815 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 19:54:29,829 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:54:29,829 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:54:29,830 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:54:29,830 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 19:54:29,831 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 19:54:29,831 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 19:54:29,831 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 19:54:29,831 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 19:54:29,831 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 19:54:29,831 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 19:54:29,832 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 19:54:29,832 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:54:29,832 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:54:29,833 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:54:29,833 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:54:29,835 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:54:29,835 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:54:29,835 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:54:29,835 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:54:29,835 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:54:29,835 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:54:29,836 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:54:29,836 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:54:29,836 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:54:29,836 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:54:29,836 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:54:29,836 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:54:29,837 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:54:29,837 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:54:29,837 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:54:29,837 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 19:54:29,837 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:54:29,838 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:54:29,838 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:54:29,838 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1da26dc017449c0cb12d610e89da82d7cad61026 [2018-10-26 19:54:29,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:54:29,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:54:29,892 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:54:29,893 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:54:29,894 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:54:29,895 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-10-26 19:54:29,951 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/data/94157eef7/401e3ede269c44ab8a3dff0ad1e06260/FLAGf714ff352 [2018-10-26 19:54:30,400 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:54:30,401 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-10-26 19:54:30,416 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/data/94157eef7/401e3ede269c44ab8a3dff0ad1e06260/FLAGf714ff352 [2018-10-26 19:54:30,428 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/data/94157eef7/401e3ede269c44ab8a3dff0ad1e06260 [2018-10-26 19:54:30,431 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:54:30,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 19:54:30,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:54:30,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:54:30,437 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:54:30,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:54:30" (1/1) ... [2018-10-26 19:54:30,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f228634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:30, skipping insertion in model container [2018-10-26 19:54:30,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:54:30" (1/1) ... [2018-10-26 19:54:30,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:54:30,503 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:54:30,790 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:54:30,799 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:54:30,847 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:54:30,893 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:54:30,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:30 WrapperNode [2018-10-26 19:54:30,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:54:30,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:54:30,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:54:30,895 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:54:30,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:30" (1/1) ... [2018-10-26 19:54:30,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:30" (1/1) ... [2018-10-26 19:54:31,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:54:31,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:54:31,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:54:31,027 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:54:31,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:30" (1/1) ... [2018-10-26 19:54:31,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:30" (1/1) ... [2018-10-26 19:54:31,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:30" (1/1) ... [2018-10-26 19:54:31,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:30" (1/1) ... [2018-10-26 19:54:31,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:30" (1/1) ... [2018-10-26 19:54:31,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:30" (1/1) ... [2018-10-26 19:54:31,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:30" (1/1) ... [2018-10-26 19:54:31,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:54:31,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:54:31,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:54:31,068 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:54:31,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/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 [2018-10-26 19:54:31,152 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-10-26 19:54:31,153 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-10-26 19:54:31,153 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:54:31,153 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-10-26 19:54:31,154 INFO L130 BoogieDeclarations]: Found specification of procedure dll_append [2018-10-26 19:54:31,154 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_append [2018-10-26 19:54:31,154 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-10-26 19:54:31,154 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-10-26 19:54:31,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 19:54:31,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 19:54:31,154 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 19:54:31,155 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 19:54:31,155 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-10-26 19:54:31,155 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-10-26 19:54:31,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:54:31,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:54:31,973 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:54:31,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:54:31 BoogieIcfgContainer [2018-10-26 19:54:31,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:54:31,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:54:31,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:54:31,979 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:54:31,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:54:30" (1/3) ... [2018-10-26 19:54:31,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2115d6e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:54:31, skipping insertion in model container [2018-10-26 19:54:31,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:30" (2/3) ... [2018-10-26 19:54:31,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2115d6e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:54:31, skipping insertion in model container [2018-10-26 19:54:31,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:54:31" (3/3) ... [2018-10-26 19:54:31,989 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-10-26 19:54:32,012 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:54:32,021 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:54:32,062 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:54:32,102 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:54:32,102 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:54:32,103 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:54:32,103 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:54:32,103 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:54:32,104 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:54:32,104 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:54:32,104 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:54:32,123 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-10-26 19:54:32,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 19:54:32,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:54:32,132 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:54:32,135 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:54:32,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:32,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1500643865, now seen corresponding path program 1 times [2018-10-26 19:54:32,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:54:32,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:32,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:32,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:32,207 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:54:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:32,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:32,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:54:32,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:54:32,335 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:54:32,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 19:54:32,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 19:54:32,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 19:54:32,363 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-10-26 19:54:32,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:54:32,390 INFO L93 Difference]: Finished difference Result 104 states and 130 transitions. [2018-10-26 19:54:32,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 19:54:32,391 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-10-26 19:54:32,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:54:32,401 INFO L225 Difference]: With dead ends: 104 [2018-10-26 19:54:32,402 INFO L226 Difference]: Without dead ends: 45 [2018-10-26 19:54:32,406 INFO L605 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 [2018-10-26 19:54:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-26 19:54:32,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-26 19:54:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-26 19:54:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2018-10-26 19:54:32,458 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 29 [2018-10-26 19:54:32,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:54:32,458 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2018-10-26 19:54:32,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 19:54:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-10-26 19:54:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 19:54:32,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:54:32,460 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:54:32,461 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:54:32,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:32,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1596071344, now seen corresponding path program 1 times [2018-10-26 19:54:32,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:54:32,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:32,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:32,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:32,469 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:54:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:32,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:32,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:54:32,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 19:54:32,680 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:54:32,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:54:32,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:54:32,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:54:32,683 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 5 states. [2018-10-26 19:54:32,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:54:32,786 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2018-10-26 19:54:32,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:54:32,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-10-26 19:54:32,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:54:32,790 INFO L225 Difference]: With dead ends: 82 [2018-10-26 19:54:32,790 INFO L226 Difference]: Without dead ends: 51 [2018-10-26 19:54:32,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:54:32,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-26 19:54:32,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-10-26 19:54:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-26 19:54:32,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-10-26 19:54:32,801 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 30 [2018-10-26 19:54:32,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:54:32,801 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-10-26 19:54:32,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:54:32,801 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-10-26 19:54:32,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-26 19:54:32,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:54:32,803 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:54:32,803 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:54:32,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:32,803 INFO L82 PathProgramCache]: Analyzing trace with hash -744465178, now seen corresponding path program 1 times [2018-10-26 19:54:32,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:54:32,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:32,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:32,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:32,807 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:54:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:32,918 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:54:32,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:54:32,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:54:32,918 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:54:32,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:54:32,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:54:32,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:54:32,919 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 3 states. [2018-10-26 19:54:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:54:33,003 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2018-10-26 19:54:33,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:54:33,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-26 19:54:33,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:54:33,007 INFO L225 Difference]: With dead ends: 88 [2018-10-26 19:54:33,007 INFO L226 Difference]: Without dead ends: 51 [2018-10-26 19:54:33,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:54:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-26 19:54:33,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-10-26 19:54:33,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-26 19:54:33,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2018-10-26 19:54:33,016 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 41 [2018-10-26 19:54:33,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:54:33,017 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-10-26 19:54:33,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:54:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-10-26 19:54:33,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-26 19:54:33,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:54:33,019 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:54:33,019 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:54:33,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:33,020 INFO L82 PathProgramCache]: Analyzing trace with hash -878478684, now seen corresponding path program 1 times [2018-10-26 19:54:33,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:54:33,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:33,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:33,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:33,023 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:54:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:54:33,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:54:33,204 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:54:33,206 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-10-26 19:54:33,208 INFO L202 CegarAbsIntRunner]: [4], [5], [6], [10], [14], [16], [18], [23], [25], [29], [30], [31], [33], [36], [55], [59], [61], [63], [93], [97], [102], [120], [126], [128], [129], [130], [131], [132], [133], [134], [135], [136], [138], [139], [140], [141] [2018-10-26 19:54:33,271 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:54:33,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:54:33,827 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 19:54:33,829 INFO L272 AbstractInterpreter]: Visited 20 different actions 31 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 46 variables. [2018-10-26 19:54:33,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:33,881 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 19:54:34,327 INFO L227 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 85.26% of their original sizes. [2018-10-26 19:54:34,328 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 19:54:35,707 INFO L415 sIntCurrentIteration]: We unified 40 AI predicates to 40 [2018-10-26 19:54:35,707 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 19:54:35,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:54:35,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-10-26 19:54:35,708 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:54:35,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 19:54:35,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 19:54:35,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-26 19:54:35,710 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 13 states. [2018-10-26 19:54:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:54:39,309 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2018-10-26 19:54:39,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 19:54:39,309 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-10-26 19:54:39,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:54:39,311 INFO L225 Difference]: With dead ends: 93 [2018-10-26 19:54:39,311 INFO L226 Difference]: Without dead ends: 62 [2018-10-26 19:54:39,312 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-10-26 19:54:39,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-26 19:54:39,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-10-26 19:54:39,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-26 19:54:39,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-10-26 19:54:39,326 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 41 [2018-10-26 19:54:39,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:54:39,326 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-10-26 19:54:39,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 19:54:39,326 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-10-26 19:54:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-26 19:54:39,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:54:39,328 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:54:39,328 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:54:39,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:39,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1765744498, now seen corresponding path program 1 times [2018-10-26 19:54:39,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:54:39,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:39,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:39,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:39,332 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:54:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 19:54:41,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:54:41,060 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:54:41,060 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-10-26 19:54:41,061 INFO L202 CegarAbsIntRunner]: [4], [5], [6], [10], [14], [16], [18], [21], [23], [25], [29], [30], [31], [33], [36], [55], [59], [61], [63], [93], [97], [102], [120], [126], [128], [129], [130], [131], [132], [133], [134], [135], [136], [138], [139], [140], [141] [2018-10-26 19:54:41,064 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:54:41,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:54:41,664 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:54:41,664 INFO L272 AbstractInterpreter]: Visited 37 different actions 118 times. Merged at 17 different actions 39 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 46 variables. [2018-10-26 19:54:41,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:41,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:54:41,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:54:41,678 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:54:41,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:41,708 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:54:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:41,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:54:42,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:54:42,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:54:42,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:54:42,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:54:42,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:54:42,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-10-26 19:54:42,963 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_write~$Pointer$_#ptr.offset| Int) (node_create_~temp~0.base Int) (|node_create_write~$Pointer$_#value.base| Int)) (and (<= 8 |node_create_write~$Pointer$_#ptr.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) 4 0) |node_create_write~$Pointer$_#ptr.offset| |node_create_write~$Pointer$_#value.base|))))) is different from true [2018-10-26 19:54:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2018-10-26 19:54:43,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:54:43,442 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-26 19:54:43,652 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-26 19:54:46,346 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_node_create_write~$Pointer$_#value.base_12| Int) (v_dll_append_~head.offset_BEFORE_CALL_2 Int) (|v_node_create_write~$Pointer$_#ptr.offset_12| Int) (v_dll_append_~head.base_BEFORE_CALL_2 Int) (node_create_~temp~0.base Int)) (or (< |v_node_create_write~$Pointer$_#ptr.offset_12| (+ c_node_create_~temp~0.offset 8)) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| node_create_~temp~0.base (store (store (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) (+ c_node_create_~temp~0.offset 4) 0) |v_node_create_write~$Pointer$_#ptr.offset_12| |v_node_create_write~$Pointer$_#value.base_12|)) v_dll_append_~head.base_BEFORE_CALL_2) v_dll_append_~head.offset_BEFORE_CALL_2))) (exists ((|v_node_create_write~$Pointer$_#value.base_11| Int) (|v_node_create_write~$Pointer$_#ptr.offset_11| Int) (|v_node_create_write~$Pointer$_#ptr.base_11| Int)) (and (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_write~$Pointer$_#ptr.base_11| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_write~$Pointer$_#ptr.base_11|) 4 0) |v_node_create_write~$Pointer$_#ptr.offset_11| |v_node_create_write~$Pointer$_#value.base_11|)) v_dll_append_~head.base_BEFORE_CALL_2) v_dll_append_~head.offset_BEFORE_CALL_2)) (<= 8 |v_node_create_write~$Pointer$_#ptr.offset_11|))))) is different from false [2018-10-26 19:54:48,377 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_node_create_write~$Pointer$_#value.base_12| Int) (v_dll_append_~head.offset_BEFORE_CALL_2 Int) (|v_node_create_write~$Pointer$_#ptr.offset_12| Int) (v_dll_append_~head.base_BEFORE_CALL_2 Int) (node_create_~temp~0.base Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| node_create_~temp~0.base (store (store (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) 4 0) |v_node_create_write~$Pointer$_#ptr.offset_12| |v_node_create_write~$Pointer$_#value.base_12|)) v_dll_append_~head.base_BEFORE_CALL_2) v_dll_append_~head.offset_BEFORE_CALL_2) 0)) (< |v_node_create_write~$Pointer$_#ptr.offset_12| 8) (exists ((|v_node_create_write~$Pointer$_#value.base_11| Int) (|v_node_create_write~$Pointer$_#ptr.offset_11| Int) (|v_node_create_write~$Pointer$_#ptr.base_11| Int)) (and (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| |v_node_create_write~$Pointer$_#ptr.base_11| (store (store (select |c_old(#memory_$Pointer$.base)| |v_node_create_write~$Pointer$_#ptr.base_11|) 4 0) |v_node_create_write~$Pointer$_#ptr.offset_11| |v_node_create_write~$Pointer$_#value.base_11|)) v_dll_append_~head.base_BEFORE_CALL_2) v_dll_append_~head.offset_BEFORE_CALL_2)) (<= 8 |v_node_create_write~$Pointer$_#ptr.offset_11|))))) is different from false [2018-10-26 19:54:49,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-10-26 19:54:49,261 INFO L477 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 9 treesize of output 8 [2018-10-26 19:54:49,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:54:49,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-26 19:54:49,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 4 [2018-10-26 19:54:49,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:54:49,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:54:49,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-26 19:54:49,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2018-10-26 19:54:49,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 14 treesize of output 8 [2018-10-26 19:54:49,429 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 19:54:49,430 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 19:54:49,430 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 19:54:49,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 8 [2018-10-26 19:54:49,453 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 19:54:49,455 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:54:49,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-10-26 19:54:49,457 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 19:54:49,494 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:54:49,505 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:54:49,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-26 19:54:49,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:54:49,547 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:39, output treesize:12 [2018-10-26 19:54:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2018-10-26 19:54:50,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 19:54:50,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19] total 46 [2018-10-26 19:54:50,004 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 19:54:50,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-26 19:54:50,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-26 19:54:50,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1654, Unknown=7, NotChecked=252, Total=2070 [2018-10-26 19:54:50,007 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 36 states. [2018-10-26 19:54:51,182 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2018-10-26 19:54:53,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:54:53,526 INFO L93 Difference]: Finished difference Result 131 states and 157 transitions. [2018-10-26 19:54:53,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-26 19:54:53,528 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 52 [2018-10-26 19:54:53,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:54:53,530 INFO L225 Difference]: With dead ends: 131 [2018-10-26 19:54:53,531 INFO L226 Difference]: Without dead ends: 81 [2018-10-26 19:54:53,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=311, Invalid=3354, Unknown=7, NotChecked=360, Total=4032 [2018-10-26 19:54:53,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-26 19:54:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2018-10-26 19:54:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-26 19:54:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-10-26 19:54:53,551 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 52 [2018-10-26 19:54:53,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:54:53,552 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-10-26 19:54:53,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-26 19:54:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-10-26 19:54:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-26 19:54:53,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:54:53,556 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:54:53,556 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:54:53,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:53,556 INFO L82 PathProgramCache]: Analyzing trace with hash -108350180, now seen corresponding path program 1 times [2018-10-26 19:54:53,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:54:53,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:53,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:53,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:53,558 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:54:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:54,073 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-26 19:54:55,453 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2018-10-26 19:54:55,882 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-10-26 19:54:56,412 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2018-10-26 19:54:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 19:54:56,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:54:56,674 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:54:56,674 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-10-26 19:54:56,675 INFO L202 CegarAbsIntRunner]: [4], [5], [6], [10], [14], [16], [18], [21], [23], [25], [29], [30], [31], [33], [38], [42], [44], [47], [53], [55], [59], [61], [63], [93], [97], [102], [120], [126], [128], [129], [130], [131], [132], [133], [134], [135], [136], [138], [139], [140], [141] [2018-10-26 19:54:56,678 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:54:56,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:54:57,370 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:54:57,370 INFO L272 AbstractInterpreter]: Visited 41 different actions 126 times. Merged at 17 different actions 39 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 46 variables. [2018-10-26 19:54:57,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:57,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:54:57,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:54:57,410 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:54:57,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:57,426 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:54:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:57,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:54:57,511 INFO L477 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 [2018-10-26 19:54:57,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:54:57,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:54:57,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 19:54:58,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 19:54:58,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 19:54:58,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:54:58,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:54:58,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:54:58,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2018-10-26 19:54:58,201 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:54:58,285 INFO L303 Elim1Store]: Index analysis took 132 ms [2018-10-26 19:54:58,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 91 [2018-10-26 19:54:58,291 INFO L477 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 14 treesize of output 13 [2018-10-26 19:54:58,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:54:58,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:54:58,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:54:58,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:72 [2018-10-26 19:54:58,735 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:54:58,737 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:54:58,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 50 [2018-10-26 19:54:58,741 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:54:58,743 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:54:58,744 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:54:58,945 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:54:58,945 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_3 term size 27 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-26 19:54:58,949 INFO L168 Benchmark]: Toolchain (without parser) took 28517.30 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 402.7 MB). Free memory was 950.4 MB in the beginning and 1.0 GB in the end (delta: -60.0 MB). Peak memory consumption was 342.6 MB. Max. memory is 11.5 GB. [2018-10-26 19:54:58,950 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:54:58,950 INFO L168 Benchmark]: CACSL2BoogieTranslator took 461.22 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 926.3 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-26 19:54:58,951 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 926.3 MB in the beginning and 1.2 GB in the end (delta: -230.7 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2018-10-26 19:54:58,951 INFO L168 Benchmark]: Boogie Preprocessor took 40.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 19:54:58,952 INFO L168 Benchmark]: RCFGBuilder took 905.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2018-10-26 19:54:58,952 INFO L168 Benchmark]: TraceAbstraction took 26973.70 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 244.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 106.7 MB). Peak memory consumption was 351.5 MB. Max. memory is 11.5 GB. [2018-10-26 19:54:58,955 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 461.22 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 926.3 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 132.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 926.3 MB in the beginning and 1.2 GB in the end (delta: -230.7 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 905.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26973.70 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 244.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 106.7 MB). Peak memory consumption was 351.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_3 term size 27 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_3 term size 27: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:55:01,065 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:55:01,067 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:55:01,078 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:55:01,078 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:55:01,079 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:55:01,080 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:55:01,081 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:55:01,083 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:55:01,083 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:55:01,084 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:55:01,084 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:55:01,086 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:55:01,087 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:55:01,088 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:55:01,089 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:55:01,090 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:55:01,091 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:55:01,093 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:55:01,095 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:55:01,096 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:55:01,097 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:55:01,100 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:55:01,100 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:55:01,100 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:55:01,101 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:55:01,102 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:55:01,103 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:55:01,104 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:55:01,105 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:55:01,106 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:55:01,106 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:55:01,106 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:55:01,107 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:55:01,108 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:55:01,109 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:55:01,109 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-26 19:55:01,123 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:55:01,124 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:55:01,124 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:55:01,125 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 19:55:01,125 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 19:55:01,126 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 19:55:01,126 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 19:55:01,126 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 19:55:01,127 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:55:01,127 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:55:01,127 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:55:01,127 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:55:01,128 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:55:01,128 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:55:01,128 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:55:01,128 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 19:55:01,128 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 19:55:01,128 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:55:01,129 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:55:01,129 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:55:01,131 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:55:01,131 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:55:01,131 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:55:01,132 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:55:01,132 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:55:01,132 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:55:01,132 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:55:01,132 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:55:01,132 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-26 19:55:01,133 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:55:01,133 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 19:55:01,133 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 19:55:01,133 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1da26dc017449c0cb12d610e89da82d7cad61026 [2018-10-26 19:55:01,175 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:55:01,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:55:01,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:55:01,192 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:55:01,192 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:55:01,194 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-10-26 19:55:01,241 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/data/d22fdad92/b36ec3f5880d419faae7c8efb6e80751/FLAGeaa9ae244 [2018-10-26 19:55:01,770 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:55:01,771 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-10-26 19:55:01,789 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/data/d22fdad92/b36ec3f5880d419faae7c8efb6e80751/FLAGeaa9ae244 [2018-10-26 19:55:01,804 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/data/d22fdad92/b36ec3f5880d419faae7c8efb6e80751 [2018-10-26 19:55:01,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:55:01,809 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 19:55:01,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:55:01,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:55:01,815 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:55:01,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:55:01" (1/1) ... [2018-10-26 19:55:01,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27618903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:55:01, skipping insertion in model container [2018-10-26 19:55:01,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:55:01" (1/1) ... [2018-10-26 19:55:01,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:55:01,882 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:55:02,277 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:55:02,293 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:55:02,355 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:55:02,417 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:55:02,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:55:02 WrapperNode [2018-10-26 19:55:02,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:55:02,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:55:02,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:55:02,419 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:55:02,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:55:02" (1/1) ... [2018-10-26 19:55:02,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:55:02" (1/1) ... [2018-10-26 19:55:02,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:55:02,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:55:02,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:55:02,566 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:55:02,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:55:02" (1/1) ... [2018-10-26 19:55:02,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:55:02" (1/1) ... [2018-10-26 19:55:02,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:55:02" (1/1) ... [2018-10-26 19:55:02,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:55:02" (1/1) ... [2018-10-26 19:55:02,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:55:02" (1/1) ... [2018-10-26 19:55:02,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:55:02" (1/1) ... [2018-10-26 19:55:02,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:55:02" (1/1) ... [2018-10-26 19:55:02,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:55:02,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:55:02,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:55:02,630 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:55:02,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:55:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/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 [2018-10-26 19:55:02,729 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-10-26 19:55:02,730 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-10-26 19:55:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:55:02,730 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-10-26 19:55:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure dll_append [2018-10-26 19:55:02,730 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_append [2018-10-26 19:55:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-10-26 19:55:02,731 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-10-26 19:55:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 19:55:02,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 19:55:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 19:55:02,731 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 19:55:02,732 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-10-26 19:55:02,732 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-10-26 19:55:02,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:55:02,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:55:03,562 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:55:03,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:55:03 BoogieIcfgContainer [2018-10-26 19:55:03,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:55:03,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:55:03,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:55:03,568 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:55:03,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:55:01" (1/3) ... [2018-10-26 19:55:03,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d700faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:55:03, skipping insertion in model container [2018-10-26 19:55:03,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:55:02" (2/3) ... [2018-10-26 19:55:03,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d700faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:55:03, skipping insertion in model container [2018-10-26 19:55:03,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:55:03" (3/3) ... [2018-10-26 19:55:03,572 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-10-26 19:55:03,582 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:55:03,590 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:55:03,607 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:55:03,639 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:55:03,640 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:55:03,640 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:55:03,640 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:55:03,640 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:55:03,641 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:55:03,641 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:55:03,641 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:55:03,641 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:55:03,657 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-10-26 19:55:03,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 19:55:03,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:03,666 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:55:03,668 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:03,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:03,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1500643865, now seen corresponding path program 1 times [2018-10-26 19:55:03,681 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 19:55:03,681 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 19:55:03,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:03,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:55:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:03,835 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-10-26 19:55:03,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:55:03,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:55:03,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 19:55:03,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 19:55:03,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 19:55:03,868 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-10-26 19:55:03,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:03,909 INFO L93 Difference]: Finished difference Result 104 states and 130 transitions. [2018-10-26 19:55:03,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 19:55:03,912 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-10-26 19:55:03,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:03,925 INFO L225 Difference]: With dead ends: 104 [2018-10-26 19:55:03,928 INFO L226 Difference]: Without dead ends: 45 [2018-10-26 19:55:03,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 19:55:03,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-26 19:55:03,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-26 19:55:03,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-26 19:55:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2018-10-26 19:55:03,995 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 29 [2018-10-26 19:55:03,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:03,995 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2018-10-26 19:55:03,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 19:55:03,996 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-10-26 19:55:03,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 19:55:03,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:03,999 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:55:03,999 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:03,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:03,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1596071344, now seen corresponding path program 1 times [2018-10-26 19:55:04,000 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 19:55:04,000 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 19:55:04,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:04,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:55:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:04,339 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 19:55:04,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:55:04,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 19:55:04,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:55:04,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:55:04,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:55:04,346 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 5 states. [2018-10-26 19:55:04,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:04,454 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2018-10-26 19:55:04,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:55:04,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-10-26 19:55:04,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:04,458 INFO L225 Difference]: With dead ends: 82 [2018-10-26 19:55:04,458 INFO L226 Difference]: Without dead ends: 51 [2018-10-26 19:55:04,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:55:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-26 19:55:04,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-10-26 19:55:04,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-26 19:55:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-10-26 19:55:04,470 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 30 [2018-10-26 19:55:04,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:04,471 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-10-26 19:55:04,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:55:04,471 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-10-26 19:55:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-26 19:55:04,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:04,474 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:55:04,474 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:04,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:04,475 INFO L82 PathProgramCache]: Analyzing trace with hash -744465178, now seen corresponding path program 1 times [2018-10-26 19:55:04,476 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 19:55:04,476 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 19:55:04,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:04,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:55:04,737 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:04,738 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 19:55:04,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:55:04,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:55:04,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:55:04,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:55:04,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:55:04,749 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 3 states. [2018-10-26 19:55:04,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:04,843 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2018-10-26 19:55:04,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:55:04,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-26 19:55:04,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:04,845 INFO L225 Difference]: With dead ends: 88 [2018-10-26 19:55:04,845 INFO L226 Difference]: Without dead ends: 51 [2018-10-26 19:55:04,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:55:04,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-26 19:55:04,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-10-26 19:55:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-26 19:55:04,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2018-10-26 19:55:04,855 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 41 [2018-10-26 19:55:04,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:04,856 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-10-26 19:55:04,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:55:04,856 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-10-26 19:55:04,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-26 19:55:04,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:04,859 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:55:04,859 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:04,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:04,859 INFO L82 PathProgramCache]: Analyzing trace with hash -878478684, now seen corresponding path program 1 times [2018-10-26 19:55:04,860 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 19:55:04,860 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 19:55:04,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:05,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:55:05,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:05,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:55:05,632 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:55:05,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:55:05,646 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:55:05,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:05,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:55:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:05,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:55:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:55:06,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 19:55:06,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7, 7] total 16 [2018-10-26 19:55:06,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-26 19:55:06,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-26 19:55:06,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-10-26 19:55:06,448 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 16 states. [2018-10-26 19:55:06,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:06,766 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2018-10-26 19:55:06,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 19:55:06,778 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-10-26 19:55:06,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:06,779 INFO L225 Difference]: With dead ends: 88 [2018-10-26 19:55:06,779 INFO L226 Difference]: Without dead ends: 57 [2018-10-26 19:55:06,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-10-26 19:55:06,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-26 19:55:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-10-26 19:55:06,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-26 19:55:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2018-10-26 19:55:06,790 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 41 [2018-10-26 19:55:06,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:06,790 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2018-10-26 19:55:06,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-26 19:55:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2018-10-26 19:55:06,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-26 19:55:06,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:06,792 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:55:06,792 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:06,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:06,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1765744498, now seen corresponding path program 1 times [2018-10-26 19:55:06,795 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 19:55:06,795 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 19:55:06,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:07,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:55:07,263 INFO L477 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 [2018-10-26 19:55:07,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:55:07,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:55:07,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 19:55:07,297 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= (store |c_old(#valid)| |node_create_#Ultimate.alloc_#res.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-10-26 19:55:07,664 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:55:07,665 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:55:07,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-10-26 19:55:07,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-10-26 19:55:07,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:55:07,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:55:07,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:55:07,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:27 [2018-10-26 19:55:07,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:55:07,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:55:07,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:55:07,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:55:07,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:55:07,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2018-10-26 19:55:08,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:55:08,413 INFO L477 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 8 treesize of output 7 [2018-10-26 19:55:08,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:55:08,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:55:08,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-26 19:55:08,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:38 [2018-10-26 19:55:08,572 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-10-26 19:55:08,573 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 6 variables, input treesize:78, output treesize:1 [2018-10-26 19:55:08,588 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 16 not checked. [2018-10-26 19:55:08,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:55:09,127 WARN L179 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-10-26 19:55:09,313 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-26 19:55:09,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:55:09,516 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:55:09,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:09,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:55:10,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:55:10,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:55:10,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:55:10,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:55:10,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:55:10,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-10-26 19:55:10,384 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_write~$Pointer$_#value.base| (_ BitVec 32)) (|node_create_write~$Pointer$_#ptr.base| (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_write~$Pointer$_#ptr.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) |node_create_write~$Pointer$_#value.base|)))) is different from true [2018-10-26 19:55:10,772 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2018-10-26 19:55:10,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:55:11,141 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-10-26 19:55:13,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:55:13,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2018-10-26 19:55:13,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-26 19:55:13,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-26 19:55:13,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1137, Unknown=31, NotChecked=138, Total=1406 [2018-10-26 19:55:13,419 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 36 states. [2018-10-26 19:55:14,646 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-10-26 19:55:17,853 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-10-26 19:55:19,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:19,497 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2018-10-26 19:55:19,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-26 19:55:19,499 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 52 [2018-10-26 19:55:19,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:19,502 INFO L225 Difference]: With dead ends: 104 [2018-10-26 19:55:19,502 INFO L226 Difference]: Without dead ends: 65 [2018-10-26 19:55:19,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=200, Invalid=2370, Unknown=90, NotChecked=202, Total=2862 [2018-10-26 19:55:19,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-26 19:55:19,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-10-26 19:55:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-26 19:55:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-10-26 19:55:19,517 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 52 [2018-10-26 19:55:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:19,518 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-10-26 19:55:19,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-26 19:55:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-10-26 19:55:19,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-26 19:55:19,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:19,520 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:55:19,520 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:19,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:19,520 INFO L82 PathProgramCache]: Analyzing trace with hash -108350180, now seen corresponding path program 1 times [2018-10-26 19:55:19,523 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 19:55:19,523 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 19:55:19,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:20,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:55:20,053 INFO L477 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 [2018-10-26 19:55:20,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:55:20,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:55:20,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 19:55:20,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 19:55:20,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 19:55:20,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:55:20,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:55:20,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:55:20,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2018-10-26 19:55:20,497 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:55:20,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 78 [2018-10-26 19:55:20,509 INFO L477 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 14 treesize of output 13 [2018-10-26 19:55:20,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:55:20,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:55:20,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:55:20,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:54 [2018-10-26 19:55:20,875 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:55:20,876 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:55:20,878 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:55:20,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 60 [2018-10-26 19:55:20,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 54 [2018-10-26 19:55:20,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:55:20,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:55:20,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:55:20,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:64, output treesize:63 [2018-10-26 19:55:21,054 INFO L477 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 11 treesize of output 8 [2018-10-26 19:55:21,058 INFO L477 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 8 treesize of output 7 [2018-10-26 19:55:21,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:55:21,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:55:21,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2018-10-26 19:55:21,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:55:21,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:55:21,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:55:21,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:55:21,165 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:76, output treesize:91 [2018-10-26 19:55:21,485 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (|node_create_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.base| (_ BitVec 32)) (|node_create_write~$Pointer$_#ptr.base| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.offset| (_ BitVec 32))) (let ((.cse0 (bvadd node_create_~temp~0.offset (_ bv4 32)))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_write~$Pointer$_#ptr.base|) .cse0 (_ bv0 32)) |node_create_write~$Pointer$_#ptr.offset| |node_create_write~$Pointer$_#value.base|))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_write~$Pointer$_#ptr.base|)) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |node_create_write~$Pointer$_#ptr.base|) .cse0 (_ bv0 32)) |node_create_write~$Pointer$_#ptr.offset| |node_create_write~$Pointer$_#value.offset|)) |c_#memory_$Pointer$.offset|)))) is different from true [2018-10-26 19:55:25,630 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2018-10-26 19:55:25,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:55:25,897 WARN L179 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-26 19:55:26,146 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-26 19:55:26,549 WARN L179 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-10-26 19:55:26,861 WARN L179 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-10-26 19:55:27,681 WARN L179 SmtUtils]: Spent 817.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-10-26 19:55:27,808 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-10-26 19:55:27,989 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-10-26 19:55:28,163 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-10-26 19:55:29,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:55:29,503 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365d05a6-5564-4fb0-9c98-05ad1b59ed92/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:55:29,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:29,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:55:29,880 INFO L477 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 [2018-10-26 19:55:29,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:55:29,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:55:29,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 19:55:30,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:55:30,544 INFO L477 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 8 treesize of output 7 [2018-10-26 19:55:30,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:55:30,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:55:30,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:55:30,565 INFO L477 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 8 treesize of output 7 [2018-10-26 19:55:30,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:55:30,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:55:30,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:55:30,580 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-10-26 19:55:49,064 WARN L179 SmtUtils]: Spent 12.61 s on a formula simplification. DAG size of input: 179 DAG size of output: 54 [2018-10-26 19:55:49,122 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:55:49,147 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:55:49,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-10-26 19:55:49,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:55:49,768 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:55:50,360 INFO L303 Elim1Store]: Index analysis took 652 ms [2018-10-26 19:55:50,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 210 treesize of output 223 [2018-10-26 19:56:46,259 WARN L179 SmtUtils]: Spent 55.49 s on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2018-10-26 19:56:46,279 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 191 [2018-10-26 19:56:46,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-10-26 19:56:46,332 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:46,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:52,799 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:52,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 165 [2018-10-26 19:56:52,829 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:52,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 177 [2018-10-26 19:56:52,896 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:53,108 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:59,016 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:59,017 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:56:59,100 INFO L303 Elim1Store]: Index analysis took 103 ms [2018-10-26 19:56:59,101 INFO L477 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 172 treesize of output 217 [2018-10-26 19:56:59,113 INFO L477 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 29 treesize of output 28 [2018-10-26 19:56:59,114 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:59,292 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:59,340 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 166 [2018-10-26 19:56:59,354 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:59,361 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:59,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 161 [2018-10-26 19:56:59,401 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:59,476 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:59,565 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:01,876 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:01,951 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:57:02,128 INFO L303 Elim1Store]: Index analysis took 285 ms [2018-10-26 19:57:02,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 168 treesize of output 248 [2018-10-26 19:57:02,316 INFO L477 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 232 treesize of output 231 [2018-10-26 19:57:02,316 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:04,343 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:04,355 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:04,355 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:57:04,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 288 [2018-10-26 19:57:04,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-10-26 19:57:04,395 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:04,512 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:06,386 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:06,431 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 248 [2018-10-26 19:57:06,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-10-26 19:57:06,459 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:06,518 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:07,652 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:07,790 INFO L303 Elim1Store]: Index analysis took 161 ms [2018-10-26 19:57:07,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 163 treesize of output 182 [2018-10-26 19:57:07,970 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:07,975 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:08,176 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:57:08,177 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_18 term size 50 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-26 19:57:08,180 INFO L168 Benchmark]: Toolchain (without parser) took 126371.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 301.5 MB). Free memory was 946.5 MB in the beginning and 1.2 GB in the end (delta: -227.0 MB). Peak memory consumption was 410.9 MB. Max. memory is 11.5 GB. [2018-10-26 19:57:08,180 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:57:08,181 INFO L168 Benchmark]: CACSL2BoogieTranslator took 608.02 ms. Allocated memory is still 1.0 GB. Free memory was 946.5 MB in the beginning and 919.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-10-26 19:57:08,191 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 919.7 MB in the beginning and 1.1 GB in the end (delta: -214.1 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2018-10-26 19:57:08,192 INFO L168 Benchmark]: Boogie Preprocessor took 63.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:57:08,192 INFO L168 Benchmark]: RCFGBuilder took 933.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2018-10-26 19:57:08,192 INFO L168 Benchmark]: TraceAbstraction took 124615.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.1 MB). Peak memory consumption was 411.3 MB. Max. memory is 11.5 GB. [2018-10-26 19:57:08,194 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 608.02 ms. Allocated memory is still 1.0 GB. Free memory was 946.5 MB in the beginning and 919.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 146.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 919.7 MB in the beginning and 1.1 GB in the end (delta: -214.1 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 933.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 124615.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.1 MB). Peak memory consumption was 411.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_18 term size 50 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_18 term size 50: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...