./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/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 1f270b702de634d3ad2ee5a400388c6410a4cf10 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/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 1f270b702de634d3ad2ee5a400388c6410a4cf10 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:59:34,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:59:34,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:59:34,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:59:34,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:59:34,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:59:34,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:59:34,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:59:34,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:59:34,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:59:34,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:59:34,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:59:34,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:59:34,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:59:34,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:59:34,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:59:34,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:59:34,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:59:34,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:59:34,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:59:34,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:59:34,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:59:34,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:59:34,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:59:34,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:59:34,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:59:34,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:59:34,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:59:34,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:59:34,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:59:34,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:59:34,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:59:34,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:59:34,842 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:59:34,843 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:59:34,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:59:34,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:59:34,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:59:34,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:59:34,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:59:34,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:59:34,846 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:59:34,858 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:59:34,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:59:34,859 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:59:34,859 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:59:34,859 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:59:34,859 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:59:34,859 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:59:34,859 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:59:34,859 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:59:34,860 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:59:34,860 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:59:34,860 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:59:34,860 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:59:34,860 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:59:34,860 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:59:34,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:59:34,861 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:59:34,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:59:34,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:59:34,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:59:34,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:59:34,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:59:34,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:59:34,862 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:59:34,862 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:59:34,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:59:34,862 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:59:34,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:59:34,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:59:34,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:59:34,863 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:59:34,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:59:34,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:59:34,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:59:34,863 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:59:34,863 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:59:34,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:59:34,864 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:59:34,864 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:59:34,864 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:59:34,864 INFO L138 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/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/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 -> 1f270b702de634d3ad2ee5a400388c6410a4cf10 [2019-12-07 20:59:34,973 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:59:34,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:59:34,986 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:59:34,988 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:59:34,988 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:59:34,988 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2019-12-07 20:59:35,031 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/data/efecf9df6/32e899e476d7436e8a1835513227e258/FLAGd5ce99b37 [2019-12-07 20:59:35,405 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:59:35,406 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2019-12-07 20:59:35,414 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/data/efecf9df6/32e899e476d7436e8a1835513227e258/FLAGd5ce99b37 [2019-12-07 20:59:35,422 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/data/efecf9df6/32e899e476d7436e8a1835513227e258 [2019-12-07 20:59:35,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:59:35,425 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:59:35,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:59:35,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:59:35,428 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:59:35,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:59:35" (1/1) ... [2019-12-07 20:59:35,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c131985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:59:35, skipping insertion in model container [2019-12-07 20:59:35,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:59:35" (1/1) ... [2019-12-07 20:59:35,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:59:35,466 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:59:35,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:59:35,688 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:59:35,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:59:35,752 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:59:35,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:59:35 WrapperNode [2019-12-07 20:59:35,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:59:35,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:59:35,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:59:35,753 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:59:35,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:59:35" (1/1) ... [2019-12-07 20:59:35,769 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:59:35" (1/1) ... [2019-12-07 20:59:35,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:59:35,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:59:35,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:59:35,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:59:35,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:59:35" (1/1) ... [2019-12-07 20:59:35,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:59:35" (1/1) ... [2019-12-07 20:59:35,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:59:35" (1/1) ... [2019-12-07 20:59:35,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:59:35" (1/1) ... [2019-12-07 20:59:35,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:59:35" (1/1) ... [2019-12-07 20:59:35,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:59:35" (1/1) ... [2019-12-07 20:59:35,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:59:35" (1/1) ... [2019-12-07 20:59:35,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:59:35,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:59:35,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:59:35,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:59:35,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:59:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/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 [2019-12-07 20:59:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 20:59:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:59:35,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 20:59:35,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 20:59:35,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 20:59:35,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:59:35,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:59:35,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:59:36,234 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:59:36,234 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-12-07 20:59:36,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:59:36 BoogieIcfgContainer [2019-12-07 20:59:36,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:59:36,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:59:36,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:59:36,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:59:36,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:59:35" (1/3) ... [2019-12-07 20:59:36,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444b9a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:59:36, skipping insertion in model container [2019-12-07 20:59:36,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:59:35" (2/3) ... [2019-12-07 20:59:36,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444b9a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:59:36, skipping insertion in model container [2019-12-07 20:59:36,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:59:36" (3/3) ... [2019-12-07 20:59:36,240 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2019-12-07 20:59:36,247 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:59:36,252 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-12-07 20:59:36,259 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-07 20:59:36,274 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:59:36,274 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:59:36,274 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:59:36,275 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:59:36,275 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:59:36,275 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:59:36,275 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:59:36,275 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:59:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-12-07 20:59:36,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 20:59:36,288 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:59:36,288 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 20:59:36,288 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:59:36,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:59:36,292 INFO L82 PathProgramCache]: Analyzing trace with hash 136375446, now seen corresponding path program 1 times [2019-12-07 20:59:36,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:59:36,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943718286] [2019-12-07 20:59:36,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:59:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:59:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:59:36,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943718286] [2019-12-07 20:59:36,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:59:36,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:59:36,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365246410] [2019-12-07 20:59:36,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 20:59:36,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:59:36,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 20:59:36,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 20:59:36,401 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2019-12-07 20:59:36,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:59:36,412 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2019-12-07 20:59:36,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 20:59:36,413 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-12-07 20:59:36,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:59:36,419 INFO L225 Difference]: With dead ends: 41 [2019-12-07 20:59:36,419 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 20:59:36,421 INFO L630 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 [2019-12-07 20:59:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 20:59:36,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 20:59:36,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 20:59:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-12-07 20:59:36,442 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 5 [2019-12-07 20:59:36,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:59:36,442 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-12-07 20:59:36,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 20:59:36,443 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-12-07 20:59:36,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 20:59:36,443 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:59:36,443 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 20:59:36,443 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:59:36,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:59:36,443 INFO L82 PathProgramCache]: Analyzing trace with hash -79697503, now seen corresponding path program 1 times [2019-12-07 20:59:36,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:59:36,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209945351] [2019-12-07 20:59:36,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:59:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:59:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:59:36,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209945351] [2019-12-07 20:59:36,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:59:36,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:59:36,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160394416] [2019-12-07 20:59:36,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:59:36,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:59:36,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:59:36,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:59:36,486 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 4 states. [2019-12-07 20:59:36,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:59:36,671 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-12-07 20:59:36,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:59:36,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 20:59:36,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:59:36,672 INFO L225 Difference]: With dead ends: 21 [2019-12-07 20:59:36,672 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 20:59:36,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:59:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 20:59:36,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-12-07 20:59:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-12-07 20:59:36,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-12-07 20:59:36,675 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 6 [2019-12-07 20:59:36,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:59:36,675 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-12-07 20:59:36,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:59:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-12-07 20:59:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:59:36,676 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:59:36,676 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:59:36,676 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:59:36,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:59:36,676 INFO L82 PathProgramCache]: Analyzing trace with hash 852548232, now seen corresponding path program 1 times [2019-12-07 20:59:36,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:59:36,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436371578] [2019-12-07 20:59:36,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:59:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:59:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:59:36,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436371578] [2019-12-07 20:59:36,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:59:36,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:59:36,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140288827] [2019-12-07 20:59:36,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:59:36,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:59:36,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:59:36,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:59:36,737 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 5 states. [2019-12-07 20:59:37,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:59:37,138 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-12-07 20:59:37,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:59:37,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 20:59:37,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:59:37,139 INFO L225 Difference]: With dead ends: 42 [2019-12-07 20:59:37,139 INFO L226 Difference]: Without dead ends: 40 [2019-12-07 20:59:37,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:59:37,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-07 20:59:37,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2019-12-07 20:59:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 20:59:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-12-07 20:59:37,144 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 9 [2019-12-07 20:59:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:59:37,144 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-12-07 20:59:37,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:59:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-12-07 20:59:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:59:37,145 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:59:37,145 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:59:37,145 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:59:37,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:59:37,146 INFO L82 PathProgramCache]: Analyzing trace with hash 2042310428, now seen corresponding path program 1 times [2019-12-07 20:59:37,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:59:37,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344083063] [2019-12-07 20:59:37,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:59:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:59:37,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:59:37,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344083063] [2019-12-07 20:59:37,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394944808] [2019-12-07 20:59:37,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:59:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:59:37,337 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 20:59:37,342 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:59:37,394 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:59:37,395 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 20:59:37,395 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:59:37,419 INFO L614 ElimStorePlain]: treesize reduction 10, result has 78.7 percent of original size [2019-12-07 20:59:37,422 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 20:59:37,423 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:59:37,432 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:59:37,433 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:59:37,433 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:33 [2019-12-07 20:59:37,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:59:37,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:59:37,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:59:37,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:59:37,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:59:37,512 INFO L430 ElimStorePlain]: Different costs {3=[v_prenex_10], 7=[|v_#valid_31|]} [2019-12-07 20:59:39,824 INFO L237 Elim1Store]: Index analysis took 1535 ms [2019-12-07 20:59:39,830 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:59:39,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 20:59:39,831 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:59:42,663 INFO L237 Elim1Store]: Index analysis took 2111 ms [2019-12-07 20:59:42,677 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:59:42,677 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-12-07 20:59:42,678 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:01:10,573 WARN L192 SmtUtils]: Spent 1.46 m on a formula simplification. DAG size of input: 215 DAG size of output: 213 [2019-12-07 21:01:10,574 INFO L614 ElimStorePlain]: treesize reduction 838, result has 95.2 percent of original size [2019-12-07 21:01:18,871 INFO L237 Elim1Store]: Index analysis took 7197 ms [2019-12-07 21:01:18,888 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:01:18,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 57 [2019-12-07 21:01:18,890 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 21:01:22,413 INFO L237 Elim1Store]: Index analysis took 2282 ms [2019-12-07 21:01:22,424 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:01:22,424 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2019-12-07 21:01:22,425 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 21:02:47,071 WARN L192 SmtUtils]: Spent 1.41 m on a formula simplification. DAG size of input: 209 DAG size of output: 206 [2019-12-07 21:02:47,072 INFO L614 ElimStorePlain]: treesize reduction 7922, result has 52.5 percent of original size [2019-12-07 21:02:47,083 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_9, |#memory_$Pointer$.base|, |#memory_$Pointer$.offset|, v_prenex_7], 2=[|v_#memory_int_66|, |v_#memory_int_67|, |v_#memory_int_68|, v_prenex_2, |v_#memory_int_62|, v_prenex_4, |v_#memory_int_63|, v_prenex_5, v_prenex_6, |v_#memory_int_65|], 4=[|v_#memory_int_64|], 10=[v_prenex_11, v_prenex_3, |v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_42|], 20=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|]} [2019-12-07 21:02:47,413 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 21:03:03,630 WARN L192 SmtUtils]: Spent 16.22 s on a formula simplification that was a NOOP. DAG size: 198 [2019-12-07 21:03:03,630 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:03:03,924 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 21:03:17,785 WARN L192 SmtUtils]: Spent 13.86 s on a formula simplification that was a NOOP. DAG size: 190 [2019-12-07 21:03:17,785 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:03:17,911 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 21:03:28,485 WARN L192 SmtUtils]: Spent 10.57 s on a formula simplification that was a NOOP. DAG size: 182 [2019-12-07 21:03:28,486 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:03:28,696 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 21:03:36,232 WARN L192 SmtUtils]: Spent 7.54 s on a formula simplification that was a NOOP. DAG size: 174 [2019-12-07 21:03:36,232 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:03:36,269 INFO L534 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:03:43,595 WARN L192 SmtUtils]: Spent 7.33 s on a formula simplification that was a NOOP. DAG size: 170 [2019-12-07 21:03:43,595 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:03:43,639 INFO L534 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:03:51,173 WARN L192 SmtUtils]: Spent 7.53 s on a formula simplification that was a NOOP. DAG size: 167 [2019-12-07 21:03:51,173 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:03:51,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:03:51,399 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 21:03:51,404 INFO L534 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-12-07 21:03:57,598 WARN L192 SmtUtils]: Spent 6.19 s on a formula simplification that was a NOOP. DAG size: 161 [2019-12-07 21:03:57,599 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:03:57,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:03:57,920 INFO L237 Elim1Store]: Index analysis took 177 ms [2019-12-07 21:03:57,985 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 21:03:57,985 INFO L534 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:03,589 WARN L192 SmtUtils]: Spent 5.60 s on a formula simplification that was a NOOP. DAG size: 155 [2019-12-07 21:04:03,589 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:03,932 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 21:04:03,933 INFO L534 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:08,677 WARN L192 SmtUtils]: Spent 4.74 s on a formula simplification that was a NOOP. DAG size: 148 [2019-12-07 21:04:08,678 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:08,955 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 21:04:08,956 INFO L534 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:12,451 WARN L192 SmtUtils]: Spent 3.49 s on a formula simplification that was a NOOP. DAG size: 141 [2019-12-07 21:04:12,451 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:12,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:12,690 INFO L237 Elim1Store]: Index analysis took 103 ms [2019-12-07 21:04:12,839 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 13 [2019-12-07 21:04:12,839 INFO L534 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:15,620 WARN L192 SmtUtils]: Spent 2.78 s on a formula simplification that was a NOOP. DAG size: 135 [2019-12-07 21:04:15,620 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:15,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:15,753 INFO L377 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 175 treesize of output 13 [2019-12-07 21:04:15,753 INFO L534 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:17,310 WARN L192 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 129 [2019-12-07 21:04:17,311 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:17,441 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:17,442 INFO L377 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 1 case distinctions, treesize of input 113 treesize of output 236 [2019-12-07 21:04:17,442 INFO L534 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:19,201 WARN L192 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 134 DAG size of output: 127 [2019-12-07 21:04:19,202 INFO L614 ElimStorePlain]: treesize reduction 154, result has 93.0 percent of original size [2019-12-07 21:04:19,208 INFO L534 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:04:20,183 WARN L192 SmtUtils]: Spent 974.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-12-07 21:04:20,183 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:20,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:20,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:20,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:20,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:20,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:20,210 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 21:04:20,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:20,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:20,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:20,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:20,272 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1766 treesize of output 1364 [2019-12-07 21:04:20,272 INFO L534 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:20,544 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-12-07 21:04:20,544 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:20,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:20,555 INFO L534 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:20,771 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-12-07 21:04:20,772 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:20,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:20,785 INFO L534 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:20,965 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-12-07 21:04:20,965 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:20,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:20,997 INFO L343 Elim1Store]: treesize reduction 410, result has 16.8 percent of original size [2019-12-07 21:04:20,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 891 treesize of output 847 [2019-12-07 21:04:20,998 INFO L534 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:21,183 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-07 21:04:21,184 INFO L614 ElimStorePlain]: treesize reduction 36, result has 96.0 percent of original size [2019-12-07 21:04:21,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:21,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:21,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:21,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:21,194 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 175 [2019-12-07 21:04:21,194 INFO L534 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:21,242 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:21,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:21,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:21,249 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 82 [2019-12-07 21:04:21,249 INFO L534 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:21,284 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:21,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:21,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:04:21,289 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 24 [2019-12-07 21:04:21,289 INFO L534 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:21,312 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:21,313 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 21 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-12-07 21:04:21,313 INFO L239 ElimStorePlain]: Needed 26 recursive calls to eliminate 28 variables, input treesize:17533, output treesize:72 [2019-12-07 21:04:21,365 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-12-07 21:04:21,365 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:21,368 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:21,368 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:04:21,368 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-12-07 21:04:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:04:21,370 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:04:21,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:04:21,395 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_19, |v_#memory_$Pointer$.offset_43|, v_prenex_16, |v_#memory_$Pointer$.base_43|], 2=[v_prenex_14, |v_#memory_int_67|, v_prenex_13, |v_#memory_int_62|, |v_#memory_int_63|, |v_#memory_int_65|], 3=[|v_#memory_int_66|, |v_#memory_int_64|], 4=[v_prenex_15], 10=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|, v_prenex_18, v_prenex_17], 20=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|]} [2019-12-07 21:04:21,721 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:33,626 WARN L192 SmtUtils]: Spent 11.90 s on a formula simplification that was a NOOP. DAG size: 213 [2019-12-07 21:04:33,626 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:33,743 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:41,727 WARN L192 SmtUtils]: Spent 7.98 s on a formula simplification that was a NOOP. DAG size: 204 [2019-12-07 21:04:41,727 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:41,959 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:46,802 WARN L192 SmtUtils]: Spent 4.84 s on a formula simplification that was a NOOP. DAG size: 195 [2019-12-07 21:04:46,803 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:46,927 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 21:04:49,324 WARN L192 SmtUtils]: Spent 2.40 s on a formula simplification that was a NOOP. DAG size: 186 [2019-12-07 21:04:49,324 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:49,341 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:04:52,345 WARN L192 SmtUtils]: Spent 3.00 s on a formula simplification that was a NOOP. DAG size: 182 [2019-12-07 21:04:52,345 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:52,371 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:04:55,486 WARN L192 SmtUtils]: Spent 3.11 s on a formula simplification that was a NOOP. DAG size: 178 [2019-12-07 21:04:55,487 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:55,576 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:04:58,648 WARN L192 SmtUtils]: Spent 3.07 s on a formula simplification that was a NOOP. DAG size: 174 [2019-12-07 21:04:58,648 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:04:58,691 INFO L534 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:05:01,195 WARN L192 SmtUtils]: Spent 2.50 s on a formula simplification that was a NOOP. DAG size: 170 [2019-12-07 21:05:01,195 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:01,217 INFO L534 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:05:04,127 WARN L192 SmtUtils]: Spent 2.91 s on a formula simplification that was a NOOP. DAG size: 166 [2019-12-07 21:05:04,127 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:04,161 INFO L534 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:05:06,403 WARN L192 SmtUtils]: Spent 2.24 s on a formula simplification that was a NOOP. DAG size: 162 [2019-12-07 21:05:06,403 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:06,424 INFO L534 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:05:07,876 WARN L192 SmtUtils]: Spent 1.45 s on a formula simplification that was a NOOP. DAG size: 157 [2019-12-07 21:05:07,876 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:07,893 INFO L534 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:05:08,795 WARN L192 SmtUtils]: Spent 900.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2019-12-07 21:05:08,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:08,802 INFO L534 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:05:09,665 WARN L192 SmtUtils]: Spent 862.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-12-07 21:05:09,666 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:09,688 INFO L534 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:11,691 WARN L192 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 151 DAG size of output: 136 [2019-12-07 21:05:11,692 INFO L614 ElimStorePlain]: treesize reduction 155, result has 94.6 percent of original size [2019-12-07 21:05:11,711 INFO L534 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:12,645 WARN L192 SmtUtils]: Spent 933.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2019-12-07 21:05:12,646 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:12,659 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 21:05:12,796 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 74 [2019-12-07 21:05:12,796 INFO L343 Elim1Store]: treesize reduction 970, result has 29.6 percent of original size [2019-12-07 21:05:12,797 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 3370 treesize of output 3454 [2019-12-07 21:05:12,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:05:12,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:05:12,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:05:12,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 21:05:12,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:05:12,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 21:05:12,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:05:12,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:05:12,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 21:05:12,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:05:12,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 21:05:12,809 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 21:05:12,810 INFO L430 ElimStorePlain]: Different costs {7=[v_arrayElimArr_1], 12=[v_arrayElimArr_2]} [2019-12-07 21:05:12,825 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@1f730d96 [2019-12-07 21:05:12,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [734514568] [2019-12-07 21:05:12,840 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 21:05:12,840 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:05:12,844 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 21:05:12,848 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 21:05:12,848 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 21:05:12,876 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@1f730d96 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:555) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:428) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:146) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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) [2019-12-07 21:05:12,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 21:05:12,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-12-07 21:05:12,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712051354] [2019-12-07 21:05:12,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:05:12,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:05:12,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:05:12,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:05:12,878 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 6 states. [2019-12-07 21:05:12,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 21:05:13,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:05:13,080 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@1f730d96 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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) [2019-12-07 21:05:13,086 INFO L168 Benchmark]: Toolchain (without parser) took 337659.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 938.2 MB in the beginning and 940.8 MB in the end (delta: -2.7 MB). Peak memory consumption was 111.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:05:13,086 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:05:13,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-12-07 21:05:13,089 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:05:13,090 INFO L168 Benchmark]: Boogie Preprocessor took 21.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:05:13,090 INFO L168 Benchmark]: RCFGBuilder took 429.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:05:13,092 INFO L168 Benchmark]: TraceAbstraction took 336846.99 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Free memory was 1.0 GB in the beginning and 940.8 MB in the end (delta: 93.6 MB). Peak memory consumption was 107.2 MB. Max. memory is 11.5 GB. [2019-12-07 21:05:13,097 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 429.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 336846.99 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Free memory was 1.0 GB in the beginning and 940.8 MB in the end (delta: 93.6 MB). Peak memory consumption was 107.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@1f730d96 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@1f730d96: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 21:05:14,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:05:14,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:05:14,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:05:14,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:05:14,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:05:14,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:05:14,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:05:14,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:05:14,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:05:14,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:05:14,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:05:14,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:05:14,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:05:14,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:05:14,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:05:14,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:05:14,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:05:14,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:05:14,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:05:14,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:05:14,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:05:14,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:05:14,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:05:14,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:05:14,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:05:14,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:05:14,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:05:14,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:05:14,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:05:14,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:05:14,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:05:14,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:05:14,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:05:14,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:05:14,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:05:14,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:05:14,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:05:14,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:05:14,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:05:14,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:05:14,415 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-12-07 21:05:14,425 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:05:14,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:05:14,426 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:05:14,426 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:05:14,426 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:05:14,426 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:05:14,427 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:05:14,427 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:05:14,427 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:05:14,427 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:05:14,427 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:05:14,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:05:14,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:05:14,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:05:14,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:05:14,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:05:14,428 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:05:14,428 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 21:05:14,428 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 21:05:14,429 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:05:14,429 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:05:14,429 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:05:14,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:05:14,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:05:14,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 21:05:14,429 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:05:14,429 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:05:14,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:05:14,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:05:14,430 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:05:14,430 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:05:14,430 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 21:05:14,430 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 21:05:14,430 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:05:14,431 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:05:14,431 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:05:14,431 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/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 -> 1f270b702de634d3ad2ee5a400388c6410a4cf10 [2019-12-07 21:05:14,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:05:14,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:05:14,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:05:14,619 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:05:14,620 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:05:14,620 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2019-12-07 21:05:14,667 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/data/8024f2fbb/3180d03d2aee4e218b365381e9832464/FLAGab46e4ba1 [2019-12-07 21:05:15,045 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:05:15,045 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2019-12-07 21:05:15,053 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/data/8024f2fbb/3180d03d2aee4e218b365381e9832464/FLAGab46e4ba1 [2019-12-07 21:05:15,440 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/data/8024f2fbb/3180d03d2aee4e218b365381e9832464 [2019-12-07 21:05:15,442 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:05:15,443 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:05:15,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:05:15,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:05:15,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:05:15,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:05:15" (1/1) ... [2019-12-07 21:05:15,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b358af7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:05:15, skipping insertion in model container [2019-12-07 21:05:15,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:05:15" (1/1) ... [2019-12-07 21:05:15,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:05:15,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:05:15,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:05:15,706 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:05:15,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:05:15,766 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:05:15,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:05:15 WrapperNode [2019-12-07 21:05:15,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:05:15,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:05:15,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:05:15,767 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:05:15,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:05:15" (1/1) ... [2019-12-07 21:05:15,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:05:15" (1/1) ... [2019-12-07 21:05:15,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:05:15,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:05:15,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:05:15,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:05:15,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:05:15" (1/1) ... [2019-12-07 21:05:15,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:05:15" (1/1) ... [2019-12-07 21:05:15,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:05:15" (1/1) ... [2019-12-07 21:05:15,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:05:15" (1/1) ... [2019-12-07 21:05:15,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:05:15" (1/1) ... [2019-12-07 21:05:15,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:05:15" (1/1) ... [2019-12-07 21:05:15,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:05:15" (1/1) ... [2019-12-07 21:05:15,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:05:15,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:05:15,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:05:15,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:05:15,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:05:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/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 [2019-12-07 21:05:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 21:05:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 21:05:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 21:05:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 21:05:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:05:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 21:05:15,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:05:15,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:05:16,542 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:05:16,542 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-12-07 21:05:16,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:05:16 BoogieIcfgContainer [2019-12-07 21:05:16,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:05:16,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:05:16,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:05:16,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:05:16,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:05:15" (1/3) ... [2019-12-07 21:05:16,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c32132f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:05:16, skipping insertion in model container [2019-12-07 21:05:16,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:05:15" (2/3) ... [2019-12-07 21:05:16,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c32132f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:05:16, skipping insertion in model container [2019-12-07 21:05:16,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:05:16" (3/3) ... [2019-12-07 21:05:16,548 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2019-12-07 21:05:16,554 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:05:16,558 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-12-07 21:05:16,565 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-07 21:05:16,579 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:05:16,580 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:05:16,580 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:05:16,580 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:05:16,580 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:05:16,580 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:05:16,580 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:05:16,580 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:05:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-12-07 21:05:16,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 21:05:16,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:05:16,594 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 21:05:16,594 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:05:16,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:05:16,598 INFO L82 PathProgramCache]: Analyzing trace with hash 889937798, now seen corresponding path program 1 times [2019-12-07 21:05:16,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:05:16,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320820990] [2019-12-07 21:05:16,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 21:05:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:05:16,675 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 21:05:16,679 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:05:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:05:16,689 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:05:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:05:16,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320820990] [2019-12-07 21:05:16,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:05:16,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 21:05:16,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85324458] [2019-12-07 21:05:16,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 21:05:16,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:05:16,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 21:05:16,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 21:05:16,711 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-12-07 21:05:16,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:05:16,723 INFO L93 Difference]: Finished difference Result 52 states and 83 transitions. [2019-12-07 21:05:16,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 21:05:16,724 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-12-07 21:05:16,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:05:16,732 INFO L225 Difference]: With dead ends: 52 [2019-12-07 21:05:16,732 INFO L226 Difference]: Without dead ends: 22 [2019-12-07 21:05:16,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 21:05:16,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-12-07 21:05:16,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-12-07 21:05:16,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 21:05:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-12-07 21:05:16,761 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 6 [2019-12-07 21:05:16,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:05:16,761 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-12-07 21:05:16,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 21:05:16,762 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-12-07 21:05:16,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 21:05:16,762 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:05:16,762 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 21:05:16,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 21:05:16,963 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:05:16,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:05:16,963 INFO L82 PathProgramCache]: Analyzing trace with hash 889639888, now seen corresponding path program 1 times [2019-12-07 21:05:16,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:05:16,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334604720] [2019-12-07 21:05:16,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 21:05:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:05:17,033 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 21:05:17,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:05:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:05:17,050 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:05:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:05:17,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334604720] [2019-12-07 21:05:17,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:05:17,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 21:05:17,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058556676] [2019-12-07 21:05:17,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:05:17,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:05:17,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:05:17,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:05:17,055 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 4 states. [2019-12-07 21:05:17,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:05:17,238 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-12-07 21:05:17,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:05:17,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 21:05:17,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:05:17,239 INFO L225 Difference]: With dead ends: 30 [2019-12-07 21:05:17,239 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 21:05:17,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:05:17,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 21:05:17,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 20. [2019-12-07 21:05:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 21:05:17,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-12-07 21:05:17,243 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 6 [2019-12-07 21:05:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:05:17,243 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-12-07 21:05:17,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:05:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-12-07 21:05:17,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:05:17,244 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:05:17,244 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:05:17,444 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 21:05:17,445 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:05:17,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:05:17,446 INFO L82 PathProgramCache]: Analyzing trace with hash -977335784, now seen corresponding path program 1 times [2019-12-07 21:05:17,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:05:17,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760067208] [2019-12-07 21:05:17,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 21:05:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:05:17,520 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 21:05:17,522 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:05:17,549 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 21:05:17,550 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:17,554 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:17,554 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:05:17,555 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 21:05:17,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 21:05:17,579 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:17,581 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:17,581 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:05:17,582 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 21:05:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:05:17,590 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:05:17,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:05:17,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760067208] [2019-12-07 21:05:17,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:05:17,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 21:05:17,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114185312] [2019-12-07 21:05:17,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:05:17,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:05:17,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:05:17,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:05:17,595 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 5 states. [2019-12-07 21:05:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:05:18,155 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-12-07 21:05:18,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:05:18,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 21:05:18,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:05:18,156 INFO L225 Difference]: With dead ends: 45 [2019-12-07 21:05:18,157 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 21:05:18,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:05:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 21:05:18,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 26. [2019-12-07 21:05:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 21:05:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-12-07 21:05:18,162 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 9 [2019-12-07 21:05:18,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:05:18,162 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-12-07 21:05:18,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:05:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-12-07 21:05:18,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:05:18,162 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:05:18,163 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:05:18,363 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 21:05:18,364 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:05:18,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:05:18,365 INFO L82 PathProgramCache]: Analyzing trace with hash -822388269, now seen corresponding path program 1 times [2019-12-07 21:05:18,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:05:18,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69837860] [2019-12-07 21:05:18,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 21:05:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:05:18,501 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 21:05:18,504 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:05:18,516 INFO L377 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 [2019-12-07 21:05:18,516 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:18,534 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:18,539 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 21:05:18,539 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:18,553 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:18,553 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:05:18,554 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-12-07 21:05:18,628 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:18,628 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-12-07 21:05:18,629 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:18,936 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-12-07 21:05:18,937 INFO L614 ElimStorePlain]: treesize reduction 14, result has 88.6 percent of original size [2019-12-07 21:05:18,946 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:05:19,084 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-07 21:05:19,084 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:19,088 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:05:19,214 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 21:05:19,214 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:19,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:05:19,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:05:19,226 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 21:05:19,246 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:19,247 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2019-12-07 21:05:19,247 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:19,331 INFO L614 ElimStorePlain]: treesize reduction 20, result has 80.4 percent of original size [2019-12-07 21:05:19,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:05:19,338 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:19,369 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:19,371 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:05:19,371 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:113, output treesize:29 [2019-12-07 21:05:19,553 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:19,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-12-07 21:05:19,554 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:20,146 WARN L192 SmtUtils]: Spent 592.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-07 21:05:20,147 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:20,150 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_int_33|, |v_#memory_int_34|, |v_#memory_int_35|, |v_#memory_$Pointer$.offset_25|, |v_#memory_$Pointer$.base_25|], 4=[|v_#memory_int_37|]} [2019-12-07 21:05:20,155 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:05:20,649 WARN L192 SmtUtils]: Spent 493.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-12-07 21:05:20,649 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:20,653 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:05:20,798 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-12-07 21:05:20,798 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:20,802 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:05:21,151 WARN L192 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-12-07 21:05:21,152 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:21,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:05:21,157 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:21,258 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-12-07 21:05:21,258 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:21,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:05:21,263 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:21,336 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:21,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:05:21,359 INFO L343 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-12-07 21:05:21,359 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 50 [2019-12-07 21:05:21,360 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:21,396 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:21,397 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 21:05:21,398 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 10 variables, input treesize:323, output treesize:41 [2019-12-07 21:05:21,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-12-07 21:05:21,476 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:21,485 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:21,486 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:05:21,486 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:3 [2019-12-07 21:05:21,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:05:21,503 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:05:21,547 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_int_34|, |v_#memory_int_35|, |v_#memory_$Pointer$.offset_25|, |v_#memory_$Pointer$.base_25|], 3=[|v_#memory_int_33|]} [2019-12-07 21:05:21,557 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:05:21,727 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-07 21:05:21,728 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:21,734 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:05:21,856 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-12-07 21:05:21,857 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:21,860 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:23,048 WARN L192 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 71 [2019-12-07 21:05:23,049 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:05:23,052 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 21:05:24,847 WARN L192 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2019-12-07 21:05:24,848 INFO L614 ElimStorePlain]: treesize reduction 237, result has 46.6 percent of original size [2019-12-07 21:05:24,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69837860] [2019-12-07 21:05:24,852 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2019-12-07 21:05:24,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [4203561] [2019-12-07 21:05:24,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:05:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:05:24,945 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 21:05:24,945 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@37261cb2 [2019-12-07 21:05:24,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918495912] [2019-12-07 21:05:24,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54055c7f-cb72-4a0f-8157-b4c3293c6292/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:05:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:05:25,007 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 21:05:25,008 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@37261cb2 [2019-12-07 21:05:25,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:05:25,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 21:05:25,008 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 21:05:25,008 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:05:25,612 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3,6 cvc4 --incremental --print-success --lang smt --rewrite-divk,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:05:25,627 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 21:05:25,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:05:25 BoogieIcfgContainer [2019-12-07 21:05:25,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:05:25,627 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:05:25,627 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:05:25,627 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:05:25,628 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:05:16" (3/4) ... [2019-12-07 21:05:25,630 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 21:05:25,630 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:05:25,631 INFO L168 Benchmark]: Toolchain (without parser) took 10187.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 947.0 MB in the beginning and 782.4 MB in the end (delta: 164.6 MB). Peak memory consumption was 277.9 MB. Max. memory is 11.5 GB. [2019-12-07 21:05:25,631 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:05:25,632 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-12-07 21:05:25,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 21:05:25,632 INFO L168 Benchmark]: Boogie Preprocessor took 25.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:05:25,633 INFO L168 Benchmark]: RCFGBuilder took 717.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-12-07 21:05:25,633 INFO L168 Benchmark]: TraceAbstraction took 9083.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 782.4 MB in the end (delta: 267.7 MB). Peak memory consumption was 267.7 MB. Max. memory is 11.5 GB. [2019-12-07 21:05:25,633 INFO L168 Benchmark]: Witness Printer took 2.88 ms. Allocated memory is still 1.1 GB. Free memory is still 782.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:05:25,635 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 717.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9083.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 782.4 MB in the end (delta: 267.7 MB). Peak memory consumption was 267.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.88 ms. Allocated memory is still 1.1 GB. Free memory is still 782.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1030]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L994] SLL* list = malloc(sizeof(SLL)); [L995] list->next = ((void*)0) [L996] list->prev = ((void*)0) [L997] list->colour = BLACK [L999] SLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] end->next = malloc(sizeof(SLL)) [L1006] EXPR end->next [L1006] end->next->prev = end [L1007] EXPR end->next [L1007] end = end->next [L1008] end->next = ((void*)0) [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] end->colour = RED [L1017] end->next = malloc(sizeof(SLL)) [L1018] EXPR end->next [L1018] end->next->prev = end [L1019] EXPR end->next [L1019] end = end->next [L1020] end->next = ((void*)0) [L1021] end->colour = BLACK [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list [L1029] COND FALSE !(!(((void*)0) != end)) [L1030] EXPR end->colour [L1030] COND TRUE !(BLACK == end->colour) [L1030] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 3 error locations. Result: UNKNOWN, OverallTime: 9.0s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 72 SDtfs, 61 SDslu, 53 SDs, 0 SdLazy, 51 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 25 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 990 SizeOfPredicates, 7 NumberOfNonLiveVariables, 86 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...