./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test24_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_300ea2c0-2a5e-45a4-956a-243198b53d6f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_300ea2c0-2a5e-45a4-956a-243198b53d6f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_300ea2c0-2a5e-45a4-956a-243198b53d6f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_300ea2c0-2a5e-45a4-956a-243198b53d6f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/test24_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_300ea2c0-2a5e-45a4-956a-243198b53d6f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_300ea2c0-2a5e-45a4-956a-243198b53d6f/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 043660dc5a969bbd34b12cbb93ba3e467b4f8613 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 23:16:11,131 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 23:16:11,132 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 23:16:11,141 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 23:16:11,141 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 23:16:11,142 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 23:16:11,142 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 23:16:11,143 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 23:16:11,145 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 23:16:11,145 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 23:16:11,146 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 23:16:11,146 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 23:16:11,147 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 23:16:11,147 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 23:16:11,148 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 23:16:11,148 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 23:16:11,149 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 23:16:11,150 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 23:16:11,151 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 23:16:11,152 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 23:16:11,153 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 23:16:11,154 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 23:16:11,156 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 23:16:11,156 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 23:16:11,156 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 23:16:11,157 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 23:16:11,157 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 23:16:11,158 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 23:16:11,158 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 23:16:11,159 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 23:16:11,159 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 23:16:11,160 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 23:16:11,160 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 23:16:11,160 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 23:16:11,161 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 23:16:11,161 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 23:16:11,161 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_300ea2c0-2a5e-45a4-956a-243198b53d6f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 23:16:11,171 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 23:16:11,171 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 23:16:11,172 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 23:16:11,172 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 23:16:11,172 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 23:16:11,172 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 23:16:11,172 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 23:16:11,172 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 23:16:11,173 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 23:16:11,173 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 23:16:11,173 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 23:16:11,173 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 23:16:11,173 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 23:16:11,174 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 23:16:11,174 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 23:16:11,174 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 23:16:11,174 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 23:16:11,174 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 23:16:11,174 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 23:16:11,174 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 23:16:11,174 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 23:16:11,175 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 23:16:11,175 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 23:16:11,175 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 23:16:11,175 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 23:16:11,175 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 23:16:11,175 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 23:16:11,175 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 23:16:11,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 23:16:11,176 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 23:16:11,176 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 23:16:11,176 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 23:16:11,176 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 23:16:11,176 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 23:16:11,176 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 23:16:11,176 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 23:16:11,176 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_300ea2c0-2a5e-45a4-956a-243198b53d6f/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 043660dc5a969bbd34b12cbb93ba3e467b4f8613 [2018-12-02 23:16:11,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 23:16:11,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 23:16:11,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 23:16:11,212 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 23:16:11,212 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 23:16:11,213 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_300ea2c0-2a5e-45a4-956a-243198b53d6f/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/test24_true-unreach-call_true-termination.c [2018-12-02 23:16:11,252 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_300ea2c0-2a5e-45a4-956a-243198b53d6f/bin-2019/utaipan/data/104f5c5de/eaaf20e49df540219fd6ef13deac0da7/FLAG8673188cf [2018-12-02 23:16:11,674 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 23:16:11,674 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_300ea2c0-2a5e-45a4-956a-243198b53d6f/sv-benchmarks/c/ldv-regression/test24_true-unreach-call_true-termination.c [2018-12-02 23:16:11,677 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_300ea2c0-2a5e-45a4-956a-243198b53d6f/bin-2019/utaipan/data/104f5c5de/eaaf20e49df540219fd6ef13deac0da7/FLAG8673188cf [2018-12-02 23:16:11,686 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_300ea2c0-2a5e-45a4-956a-243198b53d6f/bin-2019/utaipan/data/104f5c5de/eaaf20e49df540219fd6ef13deac0da7 [2018-12-02 23:16:11,688 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 23:16:11,688 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 23:16:11,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 23:16:11,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 23:16:11,691 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 23:16:11,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:16:11" (1/1) ... [2018-12-02 23:16:11,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97cb65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:16:11, skipping insertion in model container [2018-12-02 23:16:11,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:16:11" (1/1) ... [2018-12-02 23:16:11,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 23:16:11,707 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 23:16:11,798 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:16:11,803 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 23:16:11,813 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:16:11,822 INFO L195 MainTranslator]: Completed translation [2018-12-02 23:16:11,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:16:11 WrapperNode [2018-12-02 23:16:11,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 23:16:11,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 23:16:11,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 23:16:11,823 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 23:16:11,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:16:11" (1/1) ... [2018-12-02 23:16:11,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:16:11" (1/1) ... [2018-12-02 23:16:11,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 23:16:11,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 23:16:11,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 23:16:11,836 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 23:16:11,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:16:11" (1/1) ... [2018-12-02 23:16:11,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:16:11" (1/1) ... [2018-12-02 23:16:11,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:16:11" (1/1) ... [2018-12-02 23:16:11,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:16:11" (1/1) ... [2018-12-02 23:16:11,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:16:11" (1/1) ... [2018-12-02 23:16:11,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:16:11" (1/1) ... [2018-12-02 23:16:11,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:16:11" (1/1) ... [2018-12-02 23:16:11,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 23:16:11,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 23:16:11,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 23:16:11,880 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 23:16:11,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:16:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_300ea2c0-2a5e-45a4-956a-243198b53d6f/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 23:16:11,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 23:16:11,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 23:16:11,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 23:16:11,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 23:16:11,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 23:16:11,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 23:16:11,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 23:16:11,912 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 23:16:11,912 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 23:16:11,912 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-12-02 23:16:11,912 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-12-02 23:16:11,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 23:16:12,011 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 23:16:12,011 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 23:16:12,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:16:12 BoogieIcfgContainer [2018-12-02 23:16:12,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 23:16:12,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 23:16:12,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 23:16:12,013 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 23:16:12,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:16:11" (1/3) ... [2018-12-02 23:16:12,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ce4101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:16:12, skipping insertion in model container [2018-12-02 23:16:12,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:16:11" (2/3) ... [2018-12-02 23:16:12,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ce4101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:16:12, skipping insertion in model container [2018-12-02 23:16:12,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:16:12" (3/3) ... [2018-12-02 23:16:12,015 INFO L112 eAbstractionObserver]: Analyzing ICFG test24_true-unreach-call_true-termination.c [2018-12-02 23:16:12,021 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 23:16:12,025 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 23:16:12,037 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 23:16:12,053 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 23:16:12,053 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 23:16:12,053 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 23:16:12,053 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 23:16:12,053 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 23:16:12,053 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 23:16:12,054 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 23:16:12,054 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 23:16:12,063 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-12-02 23:16:12,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 23:16:12,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:16:12,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:16:12,070 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:16:12,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:16:12,073 INFO L82 PathProgramCache]: Analyzing trace with hash 149844724, now seen corresponding path program 1 times [2018-12-02 23:16:12,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:16:12,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:16:12,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:16:12,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:16:12,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:16:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:16:12,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:16:12,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:16:12,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 23:16:12,152 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:16:12,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 23:16:12,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 23:16:12,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 23:16:12,163 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-12-02 23:16:12,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:16:12,174 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-12-02 23:16:12,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 23:16:12,174 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-12-02 23:16:12,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:16:12,180 INFO L225 Difference]: With dead ends: 35 [2018-12-02 23:16:12,180 INFO L226 Difference]: Without dead ends: 17 [2018-12-02 23:16:12,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 23:16:12,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-02 23:16:12,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-02 23:16:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-02 23:16:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-02 23:16:12,202 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-02 23:16:12,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:16:12,202 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-02 23:16:12,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 23:16:12,202 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-02 23:16:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 23:16:12,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:16:12,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:16:12,203 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:16:12,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:16:12,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1249419983, now seen corresponding path program 1 times [2018-12-02 23:16:12,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:16:12,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:16:12,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:16:12,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:16:12,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:16:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:16:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:16:12,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:16:12,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:16:12,260 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:16:12,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:16:12,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:16:12,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:16:12,262 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 4 states. [2018-12-02 23:16:12,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:16:12,295 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-02 23:16:12,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:16:12,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-02 23:16:12,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:16:12,295 INFO L225 Difference]: With dead ends: 27 [2018-12-02 23:16:12,296 INFO L226 Difference]: Without dead ends: 19 [2018-12-02 23:16:12,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:16:12,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-02 23:16:12,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-02 23:16:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 23:16:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-02 23:16:12,299 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-12-02 23:16:12,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:16:12,299 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-02 23:16:12,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:16:12,299 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-02 23:16:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 23:16:12,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:16:12,299 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:16:12,299 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:16:12,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:16:12,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1840889772, now seen corresponding path program 1 times [2018-12-02 23:16:12,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:16:12,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:16:12,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:16:12,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:16:12,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:16:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:16:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:16:12,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:16:12,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 23:16:12,358 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-02 23:16:12,359 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [8], [13], [16], [18], [23], [26], [33], [36], [37], [38], [39], [40], [42], [43] [2018-12-02 23:16:12,377 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 23:16:12,377 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 23:16:12,460 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 23:16:12,461 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Performed 98 root evaluator evaluations with a maximum evaluation depth of 5. Performed 98 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-12-02 23:16:12,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:16:12,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 23:16:12,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:16:12,467 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_300ea2c0-2a5e-45a4-956a-243198b53d6f/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 23:16:12,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:16:12,478 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 23:16:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:16:12,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:16:12,526 INFO L478 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 17 treesize of output 13 [2018-12-02 23:16:12,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-02 23:16:12,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 23:16:12,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 23:16:12,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 23:16:12,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-02 23:16:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:16:12,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 23:16:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:16:12,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 23:16:12,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2018-12-02 23:16:12,573 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 23:16:12,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:16:12,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:16:12,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-02 23:16:12,574 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 6 states. [2018-12-02 23:16:12,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:16:12,595 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-02 23:16:12,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 23:16:12,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-02 23:16:12,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:16:12,596 INFO L225 Difference]: With dead ends: 29 [2018-12-02 23:16:12,596 INFO L226 Difference]: Without dead ends: 21 [2018-12-02 23:16:12,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-12-02 23:16:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-02 23:16:12,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-02 23:16:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 23:16:12,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-02 23:16:12,598 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-12-02 23:16:12,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:16:12,599 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-02 23:16:12,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:16:12,599 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-02 23:16:12,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 23:16:12,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:16:12,599 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:16:12,599 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:16:12,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:16:12,600 INFO L82 PathProgramCache]: Analyzing trace with hash -488804505, now seen corresponding path program 2 times [2018-12-02 23:16:12,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:16:12,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:16:12,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:16:12,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:16:12,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:16:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:16:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:16:12,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:16:12,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 23:16:12,654 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 23:16:12,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 23:16:12,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:16:12,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_300ea2c0-2a5e-45a4-956a-243198b53d6f/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 23:16:12,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 23:16:12,660 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 23:16:12,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 23:16:12,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:16:12,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:16:12,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 23:16:12,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 23:16:12,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 23:16:12,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 23:16:12,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 23:16:12,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-12-02 23:16:12,712 INFO L478 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 17 treesize of output 13 [2018-12-02 23:16:12,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-02 23:16:12,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 23:16:12,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 23:16:12,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 23:16:12,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-02 23:16:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:16:12,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 23:16:12,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:16:12,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 23:16:12,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-12-02 23:16:12,758 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 23:16:12,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 23:16:12,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 23:16:12,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-02 23:16:12,759 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 10 states. [2018-12-02 23:16:12,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:16:12,833 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-12-02 23:16:12,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 23:16:12,834 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-12-02 23:16:12,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:16:12,834 INFO L225 Difference]: With dead ends: 37 [2018-12-02 23:16:12,834 INFO L226 Difference]: Without dead ends: 29 [2018-12-02 23:16:12,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2018-12-02 23:16:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-02 23:16:12,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-02 23:16:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 23:16:12,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-02 23:16:12,837 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 20 [2018-12-02 23:16:12,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:16:12,838 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-02 23:16:12,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 23:16:12,838 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-02 23:16:12,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 23:16:12,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:16:12,838 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:16:12,838 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:16:12,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:16:12,839 INFO L82 PathProgramCache]: Analyzing trace with hash 57078483, now seen corresponding path program 3 times [2018-12-02 23:16:12,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:16:12,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:16:12,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:16:12,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:16:12,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:16:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:16:12,930 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:16:12,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:16:12,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 23:16:12,931 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 23:16:12,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 23:16:12,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:16:12,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_300ea2c0-2a5e-45a4-956a-243198b53d6f/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 23:16:12,939 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 23:16:12,939 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 23:16:12,954 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 23:16:12,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:16:12,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:16:12,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 23:16:12,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 23:16:12,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 23:16:12,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 23:16:12,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 23:16:12,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-12-02 23:16:12,993 INFO L478 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 17 treesize of output 13 [2018-12-02 23:16:12,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-02 23:16:12,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 23:16:12,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 23:16:12,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 23:16:12,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-02 23:16:13,012 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:16:13,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 23:16:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:16:13,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 23:16:13,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2018-12-02 23:16:13,077 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 23:16:13,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 23:16:13,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 23:16:13,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-12-02 23:16:13,078 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 14 states. [2018-12-02 23:16:13,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:16:13,191 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-12-02 23:16:13,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 23:16:13,192 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-12-02 23:16:13,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:16:13,192 INFO L225 Difference]: With dead ends: 45 [2018-12-02 23:16:13,193 INFO L226 Difference]: Without dead ends: 37 [2018-12-02 23:16:13,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=208, Invalid=344, Unknown=0, NotChecked=0, Total=552 [2018-12-02 23:16:13,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-02 23:16:13,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-02 23:16:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 23:16:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-02 23:16:13,196 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 28 [2018-12-02 23:16:13,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:16:13,196 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-02 23:16:13,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 23:16:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-02 23:16:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 23:16:13,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:16:13,197 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:16:13,197 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:16:13,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:16:13,198 INFO L82 PathProgramCache]: Analyzing trace with hash 480004671, now seen corresponding path program 4 times [2018-12-02 23:16:13,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:16:13,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:16:13,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:16:13,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:16:13,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:16:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:16:13,410 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-02 23:16:13,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:16:13,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 23:16:13,410 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 23:16:13,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 23:16:13,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:16:13,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_300ea2c0-2a5e-45a4-956a-243198b53d6f/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 23:16:13,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:16:13,418 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 23:16:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:16:13,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:16:13,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-02 23:16:13,442 INFO L478 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 12 treesize of output 11 [2018-12-02 23:16:13,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 23:16:13,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 23:16:13,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 23:16:13,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-02 23:16:15,666 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#ad1~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_35 Int) (|v_main_~#ad1~0.offset_BEFORE_CALL_1| Int)) (= v_main_~i~0_35 (select (select |c_#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (+ (* 8 v_main_~i~0_35) |v_main_~#ad1~0.offset_BEFORE_CALL_1|)))) is different from true [2018-12-02 23:16:17,807 WARN L180 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2018-12-02 23:16:17,838 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:16:17,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 23:16:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:16:18,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 23:16:18,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 15] total 36 [2018-12-02 23:16:18,174 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 23:16:18,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-02 23:16:18,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-02 23:16:18,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1092, Unknown=1, NotChecked=66, Total=1260 [2018-12-02 23:16:18,175 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 23 states. [2018-12-02 23:16:19,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:16:19,272 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-02 23:16:19,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-02 23:16:19,272 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2018-12-02 23:16:19,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:16:19,272 INFO L225 Difference]: With dead ends: 39 [2018-12-02 23:16:19,273 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 23:16:19,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 11 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=348, Invalid=3195, Unknown=1, NotChecked=116, Total=3660 [2018-12-02 23:16:19,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 23:16:19,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 23:16:19,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 23:16:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 23:16:19,274 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-12-02 23:16:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:16:19,274 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 23:16:19,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-02 23:16:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 23:16:19,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 23:16:19,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 23:16:19,299 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 23:16:19,299 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-02 23:16:19,299 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 23:16:19,299 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 23:16:19,299 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 23:16:19,300 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 23:16:19,300 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 23:16:19,300 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-12-02 23:16:19,300 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 29 31) no Hoare annotation was computed. [2018-12-02 23:16:19,300 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 14 38) no Hoare annotation was computed. [2018-12-02 23:16:19,300 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 32) no Hoare annotation was computed. [2018-12-02 23:16:19,300 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 21 32) no Hoare annotation was computed. [2018-12-02 23:16:19,300 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 14 38) no Hoare annotation was computed. [2018-12-02 23:16:19,300 INFO L444 ceAbstractionStarter]: At program point L30(lines 15 38) the Hoare annotation is: false [2018-12-02 23:16:19,300 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 14 38) the Hoare annotation is: true [2018-12-02 23:16:19,301 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2018-12-02 23:16:19,301 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 26 28) no Hoare annotation was computed. [2018-12-02 23:16:19,301 INFO L444 ceAbstractionStarter]: At program point L26-3(lines 26 28) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (let ((.cse0 (* 8 .cse1))) (and (<= (* 8 main_~i~0) .cse0) (= 0 |main_~#ad1~0.offset|) (= (select (select |#memory_int| |main_~#ad1~0.base|) (+ .cse0 |main_~#ad1~0.offset|)) .cse1)))) [2018-12-02 23:16:19,301 INFO L444 ceAbstractionStarter]: At program point L26-4(lines 26 28) the Hoare annotation is: (let ((.cse3 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (let ((.cse1 (* 8 main_~i~0)) (.cse0 (select |#memory_int| |main_~#ad1~0.base|)) (.cse2 (* 8 .cse3))) (and (= (select .cse0 (+ .cse1 |main_~#ad1~0.offset|)) main_~i~0) (<= .cse1 .cse2) (= 0 |main_~#ad1~0.offset|) (= (select .cse0 (+ .cse2 |main_~#ad1~0.offset|)) .cse3)))) [2018-12-02 23:16:19,301 INFO L451 ceAbstractionStarter]: At program point checkENTRY(lines 9 12) the Hoare annotation is: true [2018-12-02 23:16:19,301 INFO L448 ceAbstractionStarter]: For program point checkFINAL(lines 9 12) no Hoare annotation was computed. [2018-12-02 23:16:19,301 INFO L448 ceAbstractionStarter]: For program point checkEXIT(lines 9 12) no Hoare annotation was computed. [2018-12-02 23:16:19,305 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 23:16:19,305 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 23:16:19,305 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 23:16:19,306 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 23:16:19,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 23:16:19,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 23:16:19,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 23:16:19,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 23:16:19,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:16:19 BoogieIcfgContainer [2018-12-02 23:16:19,311 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 23:16:19,311 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 23:16:19,311 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 23:16:19,312 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 23:16:19,312 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:16:12" (3/4) ... [2018-12-02 23:16:19,314 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 23:16:19,317 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 23:16:19,318 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 23:16:19,318 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2018-12-02 23:16:19,320 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-12-02 23:16:19,320 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-02 23:16:19,320 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 23:16:19,320 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 23:16:19,344 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_300ea2c0-2a5e-45a4-956a-243198b53d6f/bin-2019/utaipan/witness.graphml [2018-12-02 23:16:19,344 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 23:16:19,345 INFO L168 Benchmark]: Toolchain (without parser) took 7656.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 950.8 MB in the beginning and 863.8 MB in the end (delta: 87.0 MB). Peak memory consumption was 280.9 MB. Max. memory is 11.5 GB. [2018-12-02 23:16:19,345 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:16:19,346 INFO L168 Benchmark]: CACSL2BoogieTranslator took 133.55 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-12-02 23:16:19,346 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.44 ms. Allocated memory is still 1.0 GB. Free memory is still 940.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:16:19,346 INFO L168 Benchmark]: Boogie Preprocessor took 43.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 940.0 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-02 23:16:19,346 INFO L168 Benchmark]: RCFGBuilder took 131.21 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: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-12-02 23:16:19,347 INFO L168 Benchmark]: TraceAbstraction took 7299.39 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.8 MB). Free memory was 1.1 GB in the beginning and 869.2 MB in the end (delta: 222.5 MB). Peak memory consumption was 304.3 MB. Max. memory is 11.5 GB. [2018-12-02 23:16:19,347 INFO L168 Benchmark]: Witness Printer took 32.98 ms. Allocated memory is still 1.2 GB. Free memory was 869.2 MB in the beginning and 863.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 23:16:19,349 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 133.55 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.44 ms. Allocated memory is still 1.0 GB. Free memory is still 940.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 940.0 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 131.21 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: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7299.39 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.8 MB). Free memory was 1.1 GB in the beginning and 869.2 MB in the end (delta: 222.5 MB). Peak memory consumption was 304.3 MB. Max. memory is 11.5 GB. * Witness Printer took 32.98 ms. Allocated memory is still 1.2 GB. Free memory was 869.2 MB in the beginning and 863.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 36]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant [2018-12-02 23:16:19,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 23:16:19,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 23:16:19,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 23:16:19,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 23:16:19,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 23:16:19,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 23:16:19,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 23:16:19,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (8 * i <= 8 * unknown-#memory_int-unknown[pa][pa] && 0 == ad1) && unknown-#memory_int-unknown[ad1][8 * unknown-#memory_int-unknown[pa][pa] + ad1] == unknown-#memory_int-unknown[pa][pa] - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. SAFE Result, 7.2s OverallTime, 6 OverallIterations, 11 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 91 SDtfs, 50 SDslu, 318 SDs, 0 SdLazy, 538 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 162 SyntacticMatches, 13 SemanticMatches, 106 ConstructedPredicates, 1 IntricatePredicates, 11 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 13 PreInvPairs, 25 NumberOfFragments, 85 HoareAnnotationTreeSize, 13 FomulaSimplifications, 763 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 25 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 235 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 323 ConstructedInterpolants, 24 QuantifiedInterpolants, 75207 SizeOfPredicates, 49 NumberOfNonLiveVariables, 394 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 81/480 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...