./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.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_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/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 45b185c6c694406b0734db5727dff1b8fd93ebcf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:22:36,860 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:22:36,861 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:22:36,869 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:22:36,869 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:22:36,870 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:22:36,871 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:22:36,872 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:22:36,873 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:22:36,874 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:22:36,874 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:22:36,875 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:22:36,875 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:22:36,876 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:22:36,877 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:22:36,877 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:22:36,878 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:22:36,879 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:22:36,881 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:22:36,882 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:22:36,882 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:22:36,883 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:22:36,885 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:22:36,885 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:22:36,885 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:22:36,886 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:22:36,886 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:22:36,887 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:22:36,888 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:22:36,888 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:22:36,888 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:22:36,889 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:22:36,889 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:22:36,889 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:22:36,890 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:22:36,890 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:22:36,890 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:22:36,900 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:22:36,901 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:22:36,901 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:22:36,901 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:22:36,901 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:22:36,901 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:22:36,902 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:22:36,902 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:22:36,902 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:22:36,902 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:22:36,902 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:22:36,902 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:22:36,902 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:22:36,902 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:22:36,903 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:22:36,903 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:22:36,903 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:22:36,903 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:22:36,903 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:22:36,903 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:22:36,903 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:22:36,904 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:22:36,904 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:22:36,904 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:22:36,904 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:22:36,904 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:22:36,904 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:22:36,904 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:22:36,904 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:22:36,904 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:22:36,904 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:22:36,904 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:22:36,905 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:22:36,905 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:22:36,905 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:22:36,905 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:22:36,905 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_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/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 -> 45b185c6c694406b0734db5727dff1b8fd93ebcf [2018-12-09 19:22:36,927 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:22:36,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:22:36,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:22:36,939 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:22:36,940 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:22:36,940 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-09 19:22:36,978 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/bin-2019/utaipan/data/8817e3a69/d53b1251b9e549afb6cddd1e70e70dcc/FLAG05bd9ff2a [2018-12-09 19:22:37,381 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:22:37,381 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/sv-benchmarks/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-09 19:22:37,385 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/bin-2019/utaipan/data/8817e3a69/d53b1251b9e549afb6cddd1e70e70dcc/FLAG05bd9ff2a [2018-12-09 19:22:37,393 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/bin-2019/utaipan/data/8817e3a69/d53b1251b9e549afb6cddd1e70e70dcc [2018-12-09 19:22:37,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:22:37,395 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:22:37,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:22:37,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:22:37,398 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:22:37,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:22:37" (1/1) ... [2018-12-09 19:22:37,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f49b694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:37, skipping insertion in model container [2018-12-09 19:22:37,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:22:37" (1/1) ... [2018-12-09 19:22:37,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:22:37,417 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:22:37,520 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:22:37,522 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:22:37,543 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:22:37,551 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:22:37,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:37 WrapperNode [2018-12-09 19:22:37,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:22:37,552 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:22:37,552 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:22:37,552 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:22:37,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:37" (1/1) ... [2018-12-09 19:22:37,562 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:37" (1/1) ... [2018-12-09 19:22:37,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:22:37,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:22:37,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:22:37,594 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:22:37,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:37" (1/1) ... [2018-12-09 19:22:37,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:37" (1/1) ... [2018-12-09 19:22:37,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:37" (1/1) ... [2018-12-09 19:22:37,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:37" (1/1) ... [2018-12-09 19:22:37,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:37" (1/1) ... [2018-12-09 19:22:37,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:37" (1/1) ... [2018-12-09 19:22:37,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:37" (1/1) ... [2018-12-09 19:22:37,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:22:37,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:22:37,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:22:37,612 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:22:37,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/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-09 19:22:37,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:22:37,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:22:37,643 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2018-12-09 19:22:37,644 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2018-12-09 19:22:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-12-09 19:22:37,644 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-12-09 19:22:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:22:37,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:22:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:22:37,644 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:22:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-09 19:22:37,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-09 19:22:37,805 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:22:37,805 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 19:22:37,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:22:37 BoogieIcfgContainer [2018-12-09 19:22:37,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:22:37,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:22:37,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:22:37,808 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:22:37,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:22:37" (1/3) ... [2018-12-09 19:22:37,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9f4172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:22:37, skipping insertion in model container [2018-12-09 19:22:37,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:22:37" (2/3) ... [2018-12-09 19:22:37,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9f4172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:22:37, skipping insertion in model container [2018-12-09 19:22:37,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:22:37" (3/3) ... [2018-12-09 19:22:37,810 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-09 19:22:37,816 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:22:37,821 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 19:22:37,830 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 19:22:37,850 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:22:37,850 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:22:37,850 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:22:37,850 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:22:37,850 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:22:37,850 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:22:37,850 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:22:37,850 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:22:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-12-09 19:22:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 19:22:37,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:37,866 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:37,867 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:37,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:37,871 INFO L82 PathProgramCache]: Analyzing trace with hash -848954410, now seen corresponding path program 1 times [2018-12-09 19:22:37,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:37,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:37,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:37,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:37,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 19:22:37,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:37,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:22:37,993 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:37,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:22:38,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:22:38,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:38,005 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-12-09 19:22:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:38,037 INFO L93 Difference]: Finished difference Result 118 states and 174 transitions. [2018-12-09 19:22:38,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:22:38,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-09 19:22:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:38,045 INFO L225 Difference]: With dead ends: 118 [2018-12-09 19:22:38,045 INFO L226 Difference]: Without dead ends: 52 [2018-12-09 19:22:38,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:22:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-09 19:22:38,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-09 19:22:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-09 19:22:38,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2018-12-09 19:22:38,077 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 48 [2018-12-09 19:22:38,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:38,078 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2018-12-09 19:22:38,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:22:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2018-12-09 19:22:38,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 19:22:38,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:38,081 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:38,081 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:38,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:38,081 INFO L82 PathProgramCache]: Analyzing trace with hash -796554308, now seen corresponding path program 1 times [2018-12-09 19:22:38,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:38,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:38,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:38,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:38,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 19:22:38,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:22:38,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:22:38,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:38,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:22:38,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:22:38,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:22:38,141 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. Second operand 4 states. [2018-12-09 19:22:38,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:38,165 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2018-12-09 19:22:38,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:22:38,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-09 19:22:38,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:38,166 INFO L225 Difference]: With dead ends: 64 [2018-12-09 19:22:38,166 INFO L226 Difference]: Without dead ends: 52 [2018-12-09 19:22:38,167 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-09 19:22:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-09 19:22:38,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-09 19:22:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-09 19:22:38,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2018-12-09 19:22:38,171 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 50 [2018-12-09 19:22:38,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:38,171 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2018-12-09 19:22:38,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:22:38,171 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2018-12-09 19:22:38,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 19:22:38,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:38,172 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:38,173 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:38,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:38,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1817622662, now seen corresponding path program 1 times [2018-12-09 19:22:38,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:38,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:38,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:38,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:38,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:38,221 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 19:22:38,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:38,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:22:38,222 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-12-09 19:22:38,223 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [138], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-09 19:22:38,243 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:22:38,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:22:38,308 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 19:22:38,309 INFO L272 AbstractInterpreter]: Visited 13 different actions 15 times. Never merged. Never widened. Performed 43 root evaluator evaluations with a maximum evaluation depth of 3. Performed 43 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-12-09 19:22:38,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:38,313 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 19:22:38,347 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 79.33% of their original sizes. [2018-12-09 19:22:38,347 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 19:22:38,395 INFO L418 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-12-09 19:22:38,395 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 19:22:38,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:22:38,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-12-09 19:22:38,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:38,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:22:38,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:22:38,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:22:38,397 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand 10 states. [2018-12-09 19:22:38,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:38,728 INFO L93 Difference]: Finished difference Result 124 states and 164 transitions. [2018-12-09 19:22:38,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 19:22:38,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-12-09 19:22:38,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:38,729 INFO L225 Difference]: With dead ends: 124 [2018-12-09 19:22:38,730 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 19:22:38,730 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:22:38,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 19:22:38,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2018-12-09 19:22:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-09 19:22:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2018-12-09 19:22:38,736 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 50 [2018-12-09 19:22:38,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:38,736 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2018-12-09 19:22:38,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:22:38,737 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2018-12-09 19:22:38,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 19:22:38,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:38,737 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:38,738 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:38,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:38,738 INFO L82 PathProgramCache]: Analyzing trace with hash -30301019, now seen corresponding path program 1 times [2018-12-09 19:22:38,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:38,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:38,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:38,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:38,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 19:22:38,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:38,760 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:22:38,761 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-12-09 19:22:38,761 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [60], [64], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [145], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-09 19:22:38,763 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:22:38,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:22:38,773 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 19:22:38,774 INFO L272 AbstractInterpreter]: Visited 17 different actions 20 times. Never merged. Never widened. Performed 51 root evaluator evaluations with a maximum evaluation depth of 4. Performed 51 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 23 variables. [2018-12-09 19:22:38,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:38,775 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 19:22:38,790 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 71.46% of their original sizes. [2018-12-09 19:22:38,790 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 19:22:38,831 INFO L418 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-12-09 19:22:38,831 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 19:22:38,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:22:38,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2018-12-09 19:22:38,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:38,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:22:38,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:22:38,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:22:38,832 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand 11 states. [2018-12-09 19:22:39,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:39,102 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2018-12-09 19:22:39,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:22:39,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-12-09 19:22:39,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:39,104 INFO L225 Difference]: With dead ends: 122 [2018-12-09 19:22:39,104 INFO L226 Difference]: Without dead ends: 75 [2018-12-09 19:22:39,104 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-12-09 19:22:39,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-09 19:22:39,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2018-12-09 19:22:39,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 19:22:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2018-12-09 19:22:39,112 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 55 [2018-12-09 19:22:39,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:39,112 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2018-12-09 19:22:39,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:22:39,112 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2018-12-09 19:22:39,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 19:22:39,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:39,114 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:39,114 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:39,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:39,114 INFO L82 PathProgramCache]: Analyzing trace with hash 801154692, now seen corresponding path program 1 times [2018-12-09 19:22:39,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:39,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:39,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:39,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:39,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 19:22:39,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:39,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:22:39,172 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-12-09 19:22:39,172 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [60], [66], [71], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [145], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-09 19:22:39,174 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:22:39,174 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:22:39,180 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 19:22:39,180 INFO L272 AbstractInterpreter]: Visited 18 different actions 21 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 4. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 23 variables. [2018-12-09 19:22:39,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:39,181 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 19:22:39,192 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 66.3% of their original sizes. [2018-12-09 19:22:39,192 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 19:22:39,232 INFO L418 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-12-09 19:22:39,232 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 19:22:39,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:22:39,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-12-09 19:22:39,233 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:39,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:22:39,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:22:39,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:22:39,234 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 11 states. [2018-12-09 19:22:39,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:39,553 INFO L93 Difference]: Finished difference Result 129 states and 162 transitions. [2018-12-09 19:22:39,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 19:22:39,553 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-12-09 19:22:39,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:39,553 INFO L225 Difference]: With dead ends: 129 [2018-12-09 19:22:39,554 INFO L226 Difference]: Without dead ends: 81 [2018-12-09 19:22:39,554 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2018-12-09 19:22:39,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-09 19:22:39,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 70. [2018-12-09 19:22:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-09 19:22:39,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2018-12-09 19:22:39,559 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 57 [2018-12-09 19:22:39,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:39,559 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2018-12-09 19:22:39,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:22:39,559 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2018-12-09 19:22:39,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 19:22:39,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:39,560 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:39,560 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:39,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:39,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1162955476, now seen corresponding path program 1 times [2018-12-09 19:22:39,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:39,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:39,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:39,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:39,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 19:22:39,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:39,591 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:22:39,591 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-12-09 19:22:39,591 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [145], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-09 19:22:39,592 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:22:39,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:22:39,629 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 19:22:39,629 INFO L272 AbstractInterpreter]: Visited 33 different actions 79 times. Merged at 6 different actions 18 times. Never widened. Performed 237 root evaluator evaluations with a maximum evaluation depth of 4. Performed 237 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 4 different actions. Largest state had 23 variables. [2018-12-09 19:22:39,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:39,637 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 19:22:39,659 INFO L227 lantSequenceWeakener]: Weakened 29 states. On average, predicates are now at 61.95% of their original sizes. [2018-12-09 19:22:39,659 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 19:22:39,794 INFO L418 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-12-09 19:22:39,795 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 19:22:39,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:22:39,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [5] total 24 [2018-12-09 19:22:39,795 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:39,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 19:22:39,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 19:22:39,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-12-09 19:22:39,796 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 21 states. [2018-12-09 19:22:40,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:40,442 INFO L93 Difference]: Finished difference Result 142 states and 180 transitions. [2018-12-09 19:22:40,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-09 19:22:40,442 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-12-09 19:22:40,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:40,443 INFO L225 Difference]: With dead ends: 142 [2018-12-09 19:22:40,443 INFO L226 Difference]: Without dead ends: 122 [2018-12-09 19:22:40,443 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 19:22:40,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-09 19:22:40,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 86. [2018-12-09 19:22:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-09 19:22:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2018-12-09 19:22:40,449 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 58 [2018-12-09 19:22:40,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:40,450 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2018-12-09 19:22:40,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 19:22:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2018-12-09 19:22:40,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 19:22:40,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:40,450 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:40,450 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:40,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:40,451 INFO L82 PathProgramCache]: Analyzing trace with hash 2120894570, now seen corresponding path program 1 times [2018-12-09 19:22:40,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:40,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:40,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:40,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:40,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 19:22:40,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:40,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:22:40,475 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-12-09 19:22:40,475 INFO L205 CegarAbsIntRunner]: [0], [1], [6], [10], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [145], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-09 19:22:40,476 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:22:40,476 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:22:40,493 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 19:22:40,493 INFO L272 AbstractInterpreter]: Visited 45 different actions 84 times. Merged at 6 different actions 12 times. Never widened. Performed 226 root evaluator evaluations with a maximum evaluation depth of 4. Performed 226 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 3 different actions. Largest state had 23 variables. [2018-12-09 19:22:40,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:40,494 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 19:22:40,513 INFO L227 lantSequenceWeakener]: Weakened 40 states. On average, predicates are now at 65.05% of their original sizes. [2018-12-09 19:22:40,513 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 19:22:40,735 INFO L418 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-12-09 19:22:40,735 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 19:22:40,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:22:40,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [5] total 34 [2018-12-09 19:22:40,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:40,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-09 19:22:40,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-09 19:22:40,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2018-12-09 19:22:40,737 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand 31 states. [2018-12-09 19:22:42,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:42,011 INFO L93 Difference]: Finished difference Result 137 states and 167 transitions. [2018-12-09 19:22:42,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-09 19:22:42,011 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2018-12-09 19:22:42,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:42,012 INFO L225 Difference]: With dead ends: 137 [2018-12-09 19:22:42,013 INFO L226 Difference]: Without dead ends: 108 [2018-12-09 19:22:42,014 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 85 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=2917, Unknown=0, NotChecked=0, Total=3192 [2018-12-09 19:22:42,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-09 19:22:42,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 75. [2018-12-09 19:22:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 19:22:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2018-12-09 19:22:42,024 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 58 [2018-12-09 19:22:42,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:42,024 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2018-12-09 19:22:42,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-09 19:22:42,024 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2018-12-09 19:22:42,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 19:22:42,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:42,025 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:42,025 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:42,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:42,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1063907295, now seen corresponding path program 1 times [2018-12-09 19:22:42,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:42,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:42,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:42,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:42,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 19:22:42,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:42,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:22:42,056 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-12-09 19:22:42,056 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [77], [86], [90], [96], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-09 19:22:42,057 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:22:42,057 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:22:42,100 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 19:22:42,100 INFO L272 AbstractInterpreter]: Visited 45 different actions 165 times. Merged at 18 different actions 57 times. Never widened. Performed 585 root evaluator evaluations with a maximum evaluation depth of 4. Performed 585 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9 fixpoints after 6 different actions. Largest state had 23 variables. [2018-12-09 19:22:42,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:42,101 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 19:22:42,122 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 61.85% of their original sizes. [2018-12-09 19:22:42,122 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 19:22:42,384 INFO L418 sIntCurrentIteration]: We unified 61 AI predicates to 61 [2018-12-09 19:22:42,384 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 19:22:42,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:22:42,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [5] total 35 [2018-12-09 19:22:42,384 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:42,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-09 19:22:42,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-09 19:22:42,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-12-09 19:22:42,385 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 32 states. [2018-12-09 19:22:49,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:49,712 INFO L93 Difference]: Finished difference Result 166 states and 212 transitions. [2018-12-09 19:22:49,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-09 19:22:49,713 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-12-09 19:22:49,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:49,714 INFO L225 Difference]: With dead ends: 166 [2018-12-09 19:22:49,714 INFO L226 Difference]: Without dead ends: 150 [2018-12-09 19:22:49,715 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 89 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=337, Invalid=2969, Unknown=0, NotChecked=0, Total=3306 [2018-12-09 19:22:49,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-09 19:22:49,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 97. [2018-12-09 19:22:49,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 19:22:49,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 124 transitions. [2018-12-09 19:22:49,726 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 124 transitions. Word has length 62 [2018-12-09 19:22:49,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:49,727 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 124 transitions. [2018-12-09 19:22:49,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-09 19:22:49,727 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 124 transitions. [2018-12-09 19:22:49,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 19:22:49,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:49,728 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:49,728 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:49,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:49,728 INFO L82 PathProgramCache]: Analyzing trace with hash -851500765, now seen corresponding path program 1 times [2018-12-09 19:22:49,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:49,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:49,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:49,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:49,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:49,754 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 19:22:49,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:49,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:22:49,754 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-12-09 19:22:49,754 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [77], [86], [92], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-09 19:22:49,756 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:22:49,756 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:22:49,787 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 19:22:49,787 INFO L272 AbstractInterpreter]: Visited 45 different actions 158 times. Merged at 18 different actions 51 times. Never widened. Performed 497 root evaluator evaluations with a maximum evaluation depth of 4. Performed 497 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 5 different actions. Largest state had 23 variables. [2018-12-09 19:22:49,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:49,789 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 19:22:49,805 INFO L227 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 62.83% of their original sizes. [2018-12-09 19:22:49,805 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 19:22:49,923 INFO L418 sIntCurrentIteration]: We unified 61 AI predicates to 61 [2018-12-09 19:22:49,923 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 19:22:49,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:22:49,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [5] total 24 [2018-12-09 19:22:49,923 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:49,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 19:22:49,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 19:22:49,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-12-09 19:22:49,924 INFO L87 Difference]: Start difference. First operand 97 states and 124 transitions. Second operand 21 states. [2018-12-09 19:22:50,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:50,408 INFO L93 Difference]: Finished difference Result 133 states and 169 transitions. [2018-12-09 19:22:50,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-09 19:22:50,408 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-12-09 19:22:50,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:50,409 INFO L225 Difference]: With dead ends: 133 [2018-12-09 19:22:50,409 INFO L226 Difference]: Without dead ends: 120 [2018-12-09 19:22:50,409 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 81 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=1294, Unknown=0, NotChecked=0, Total=1482 [2018-12-09 19:22:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-09 19:22:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 75. [2018-12-09 19:22:50,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 19:22:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2018-12-09 19:22:50,416 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 62 [2018-12-09 19:22:50,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:50,416 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2018-12-09 19:22:50,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 19:22:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2018-12-09 19:22:50,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 19:22:50,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:50,417 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:50,417 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:50,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:50,417 INFO L82 PathProgramCache]: Analyzing trace with hash -265783978, now seen corresponding path program 1 times [2018-12-09 19:22:50,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:50,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:50,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:50,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:50,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 19:22:50,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:50,452 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:22:50,452 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-12-09 19:22:50,452 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [12], [15], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [77], [86], [90], [96], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-09 19:22:50,453 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:22:50,453 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:22:50,485 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:22:50,485 INFO L272 AbstractInterpreter]: Visited 51 different actions 167 times. Merged at 20 different actions 49 times. Never widened. Performed 587 root evaluator evaluations with a maximum evaluation depth of 6. Performed 587 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 6 different actions. Largest state had 23 variables. [2018-12-09 19:22:50,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:50,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:22:50,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:50,491 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/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-09 19:22:50,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:50,500 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:22:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:50,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:22:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 19:22:50,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:22:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 19:22:50,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:22:50,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-12-09 19:22:50,609 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:22:50,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:22:50,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:22:50,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:22:50,609 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 5 states. [2018-12-09 19:22:50,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:50,658 INFO L93 Difference]: Finished difference Result 151 states and 190 transitions. [2018-12-09 19:22:50,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:22:50,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-12-09 19:22:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:50,659 INFO L225 Difference]: With dead ends: 151 [2018-12-09 19:22:50,659 INFO L226 Difference]: Without dead ends: 99 [2018-12-09 19:22:50,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:22:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-09 19:22:50,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 77. [2018-12-09 19:22:50,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 19:22:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2018-12-09 19:22:50,670 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 63 [2018-12-09 19:22:50,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:50,670 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2018-12-09 19:22:50,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:22:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2018-12-09 19:22:50,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 19:22:50,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:50,671 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:50,671 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:50,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:50,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1530868887, now seen corresponding path program 1 times [2018-12-09 19:22:50,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:50,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:50,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:50,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:50,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:50,728 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 19:22:50,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:50,729 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:22:50,729 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-12-09 19:22:50,729 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [12], [15], [41], [42], [43], [46], [48], [51], [60], [66], [69], [71], [77], [86], [90], [96], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-09 19:22:50,730 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:22:50,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:22:50,772 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:22:50,772 INFO L272 AbstractInterpreter]: Visited 52 different actions 230 times. Merged at 21 different actions 79 times. Never widened. Performed 743 root evaluator evaluations with a maximum evaluation depth of 6. Performed 743 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 10 fixpoints after 4 different actions. Largest state had 23 variables. [2018-12-09 19:22:50,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:50,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:22:50,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:50,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/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-09 19:22:50,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:50,781 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:22:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:50,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:22:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 19:22:50,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:22:51,203 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 19:22:51,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:22:51,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 15] total 27 [2018-12-09 19:22:51,218 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:22:51,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 19:22:51,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 19:22:51,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2018-12-09 19:22:51,219 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand 14 states. [2018-12-09 19:22:51,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:51,589 INFO L93 Difference]: Finished difference Result 176 states and 232 transitions. [2018-12-09 19:22:51,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 19:22:51,590 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2018-12-09 19:22:51,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:51,590 INFO L225 Difference]: With dead ends: 176 [2018-12-09 19:22:51,590 INFO L226 Difference]: Without dead ends: 118 [2018-12-09 19:22:51,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=1090, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 19:22:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-09 19:22:51,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 81. [2018-12-09 19:22:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-09 19:22:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2018-12-09 19:22:51,601 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 65 [2018-12-09 19:22:51,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:51,601 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2018-12-09 19:22:51,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 19:22:51,601 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2018-12-09 19:22:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 19:22:51,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:51,602 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:51,602 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:51,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:51,602 INFO L82 PathProgramCache]: Analyzing trace with hash -2088958439, now seen corresponding path program 1 times [2018-12-09 19:22:51,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:51,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:51,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:51,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:51,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 19:22:51,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:51,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:22:51,627 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-12-09 19:22:51,627 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [12], [15], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [77], [86], [92], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-09 19:22:51,628 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:22:51,628 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:22:51,673 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:22:51,673 INFO L272 AbstractInterpreter]: Visited 51 different actions 164 times. Merged at 20 different actions 47 times. Never widened. Performed 498 root evaluator evaluations with a maximum evaluation depth of 6. Performed 498 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 4 different actions. Largest state had 23 variables. [2018-12-09 19:22:51,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:51,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:22:51,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:51,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/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-09 19:22:51,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:51,684 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:22:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:51,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:22:51,709 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 19:22:51,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:22:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 19:22:51,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:22:51,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-12-09 19:22:51,792 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:22:51,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:22:51,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:22:51,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:22:51,793 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand 6 states. [2018-12-09 19:22:51,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:51,844 INFO L93 Difference]: Finished difference Result 170 states and 216 transitions. [2018-12-09 19:22:51,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:22:51,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-09 19:22:51,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:51,845 INFO L225 Difference]: With dead ends: 170 [2018-12-09 19:22:51,845 INFO L226 Difference]: Without dead ends: 115 [2018-12-09 19:22:51,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:22:51,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-09 19:22:51,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 83. [2018-12-09 19:22:51,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-09 19:22:51,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2018-12-09 19:22:51,854 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 66 [2018-12-09 19:22:51,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:51,854 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2018-12-09 19:22:51,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:22:51,854 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2018-12-09 19:22:51,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 19:22:51,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:51,855 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:51,855 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:51,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:51,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1544781722, now seen corresponding path program 1 times [2018-12-09 19:22:51,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:51,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:51,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:51,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:51,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 19:22:51,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:51,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:22:51,920 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-12-09 19:22:51,920 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [12], [15], [41], [42], [43], [46], [48], [51], [60], [66], [69], [71], [77], [86], [92], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-09 19:22:51,920 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:22:51,920 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:22:51,944 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:22:51,945 INFO L272 AbstractInterpreter]: Visited 51 different actions 161 times. Merged at 20 different actions 42 times. Never widened. Performed 497 root evaluator evaluations with a maximum evaluation depth of 6. Performed 497 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 4 different actions. Largest state had 23 variables. [2018-12-09 19:22:51,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:51,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:22:51,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:51,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/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-09 19:22:51,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:51,953 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:22:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:51,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:22:52,081 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 19:22:52,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:22:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-09 19:22:52,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:22:52,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 22 [2018-12-09 19:22:52,316 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:22:52,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 19:22:52,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 19:22:52,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-12-09 19:22:52,317 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand 15 states. [2018-12-09 19:22:52,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:52,664 INFO L93 Difference]: Finished difference Result 194 states and 247 transitions. [2018-12-09 19:22:52,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 19:22:52,665 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2018-12-09 19:22:52,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:52,666 INFO L225 Difference]: With dead ends: 194 [2018-12-09 19:22:52,666 INFO L226 Difference]: Without dead ends: 128 [2018-12-09 19:22:52,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 121 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2018-12-09 19:22:52,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-09 19:22:52,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 84. [2018-12-09 19:22:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-09 19:22:52,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2018-12-09 19:22:52,676 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 68 [2018-12-09 19:22:52,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:52,676 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2018-12-09 19:22:52,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 19:22:52,676 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2018-12-09 19:22:52,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 19:22:52,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:52,677 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:52,677 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:52,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:52,677 INFO L82 PathProgramCache]: Analyzing trace with hash -476381260, now seen corresponding path program 1 times [2018-12-09 19:22:52,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:52,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:52,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:52,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:52,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 19:22:52,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:52,712 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:22:52,712 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-12-09 19:22:52,712 INFO L205 CegarAbsIntRunner]: [0], [1], [6], [12], [15], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [77], [86], [92], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-09 19:22:52,713 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:22:52,713 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:22:52,743 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:22:52,743 INFO L272 AbstractInterpreter]: Visited 51 different actions 161 times. Merged at 20 different actions 47 times. Never widened. Performed 457 root evaluator evaluations with a maximum evaluation depth of 6. Performed 457 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 3 different actions. Largest state had 23 variables. [2018-12-09 19:22:52,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:52,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:22:52,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:52,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:22:52,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:52,750 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:22:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:52,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:22:52,769 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 19:22:52,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:22:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 19:22:52,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:22:52,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-12-09 19:22:52,858 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:22:52,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:22:52,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:22:52,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:22:52,859 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand 7 states. [2018-12-09 19:22:52,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:52,932 INFO L93 Difference]: Finished difference Result 183 states and 232 transitions. [2018-12-09 19:22:52,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:22:52,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-12-09 19:22:52,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:52,933 INFO L225 Difference]: With dead ends: 183 [2018-12-09 19:22:52,933 INFO L226 Difference]: Without dead ends: 128 [2018-12-09 19:22:52,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=106, Invalid=134, Unknown=0, NotChecked=0, Total=240 [2018-12-09 19:22:52,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-09 19:22:52,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 86. [2018-12-09 19:22:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-09 19:22:52,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2018-12-09 19:22:52,940 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 69 [2018-12-09 19:22:52,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:52,940 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2018-12-09 19:22:52,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:22:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2018-12-09 19:22:52,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 19:22:52,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:52,940 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:52,941 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:52,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:52,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1056741109, now seen corresponding path program 1 times [2018-12-09 19:22:52,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:52,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:52,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:52,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:52,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 19:22:52,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:52,992 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:22:52,992 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 72 with the following transitions: [2018-12-09 19:22:52,992 INFO L205 CegarAbsIntRunner]: [0], [1], [6], [12], [15], [41], [42], [43], [46], [48], [51], [60], [66], [69], [71], [77], [86], [92], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-09 19:22:52,993 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:22:52,993 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:22:53,029 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:22:53,029 INFO L272 AbstractInterpreter]: Visited 51 different actions 166 times. Merged at 20 different actions 49 times. Never widened. Performed 483 root evaluator evaluations with a maximum evaluation depth of 6. Performed 483 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 4 different actions. Largest state had 23 variables. [2018-12-09 19:22:53,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:53,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:22:53,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:53,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:22:53,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:53,038 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:22:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:53,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:22:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-09 19:22:53,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:22:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-09 19:22:53,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:22:53,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 10] total 20 [2018-12-09 19:22:53,267 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:22:53,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:22:53,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:22:53,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-12-09 19:22:53,268 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand 8 states. [2018-12-09 19:22:53,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:53,314 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2018-12-09 19:22:53,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:22:53,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2018-12-09 19:22:53,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:53,315 INFO L225 Difference]: With dead ends: 104 [2018-12-09 19:22:53,315 INFO L226 Difference]: Without dead ends: 89 [2018-12-09 19:22:53,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-12-09 19:22:53,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-09 19:22:53,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2018-12-09 19:22:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-09 19:22:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2018-12-09 19:22:53,321 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 71 [2018-12-09 19:22:53,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:53,321 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2018-12-09 19:22:53,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:22:53,321 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2018-12-09 19:22:53,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 19:22:53,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:53,321 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:53,322 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:53,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:53,322 INFO L82 PathProgramCache]: Analyzing trace with hash -336734405, now seen corresponding path program 1 times [2018-12-09 19:22:53,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:53,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:53,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:53,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:53,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 19:22:53,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:53,375 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:22:53,376 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 72 with the following transitions: [2018-12-09 19:22:53,376 INFO L205 CegarAbsIntRunner]: [0], [1], [6], [12], [15], [41], [42], [43], [46], [48], [51], [60], [66], [69], [71], [77], [86], [90], [96], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-09 19:22:53,376 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:22:53,376 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:22:53,416 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:22:53,416 INFO L272 AbstractInterpreter]: Visited 52 different actions 255 times. Merged at 21 different actions 96 times. Never widened. Performed 808 root evaluator evaluations with a maximum evaluation depth of 6. Performed 808 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 5 different actions. Largest state had 23 variables. [2018-12-09 19:22:53,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:53,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:22:53,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:53,418 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:22:53,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:53,424 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:22:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:53,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:22:53,549 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 19:22:53,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:22:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-09 19:22:53,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:22:53,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 9] total 22 [2018-12-09 19:22:53,809 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:22:53,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 19:22:53,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 19:22:53,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-12-09 19:22:53,809 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 16 states. [2018-12-09 19:22:56,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:56,380 INFO L93 Difference]: Finished difference Result 200 states and 241 transitions. [2018-12-09 19:22:56,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-09 19:22:56,381 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2018-12-09 19:22:56,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:56,381 INFO L225 Difference]: With dead ends: 200 [2018-12-09 19:22:56,381 INFO L226 Difference]: Without dead ends: 118 [2018-12-09 19:22:56,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=214, Invalid=1508, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 19:22:56,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-09 19:22:56,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 82. [2018-12-09 19:22:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-09 19:22:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-12-09 19:22:56,387 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 71 [2018-12-09 19:22:56,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:56,387 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-12-09 19:22:56,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 19:22:56,387 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-12-09 19:22:56,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 19:22:56,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:56,388 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:56,388 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:56,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:56,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1992333140, now seen corresponding path program 1 times [2018-12-09 19:22:56,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:56,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:56,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:56,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:56,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:56,419 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 19:22:56,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:56,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:22:56,420 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 77 with the following transitions: [2018-12-09 19:22:56,420 INFO L205 CegarAbsIntRunner]: [0], [1], [6], [12], [15], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [77], [86], [90], [92], [96], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-09 19:22:56,420 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:22:56,420 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:22:56,463 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:22:56,463 INFO L272 AbstractInterpreter]: Visited 53 different actions 278 times. Merged at 21 different actions 107 times. Never widened. Performed 870 root evaluator evaluations with a maximum evaluation depth of 6. Performed 870 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 11 fixpoints after 5 different actions. Largest state had 23 variables. [2018-12-09 19:22:56,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:56,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:22:56,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:56,464 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:22:56,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:56,470 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:22:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:56,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:22:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 26 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 19:22:56,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:22:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 19:22:56,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:22:56,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-12-09 19:22:56,577 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:22:56,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:22:56,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:22:56,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:22:56,578 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-12-09 19:22:56,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:22:56,610 INFO L93 Difference]: Finished difference Result 168 states and 196 transitions. [2018-12-09 19:22:56,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:22:56,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2018-12-09 19:22:56,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:22:56,611 INFO L225 Difference]: With dead ends: 168 [2018-12-09 19:22:56,611 INFO L226 Difference]: Without dead ends: 118 [2018-12-09 19:22:56,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=119, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:22:56,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-09 19:22:56,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 84. [2018-12-09 19:22:56,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-09 19:22:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-12-09 19:22:56,618 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 76 [2018-12-09 19:22:56,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:22:56,619 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-12-09 19:22:56,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:22:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-12-09 19:22:56,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 19:22:56,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:22:56,619 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:22:56,619 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:22:56,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:56,619 INFO L82 PathProgramCache]: Analyzing trace with hash -581082707, now seen corresponding path program 1 times [2018-12-09 19:22:56,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:22:56,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:56,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:56,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:22:56,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:22:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 41 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 19:22:56,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:56,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:22:56,674 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 79 with the following transitions: [2018-12-09 19:22:56,674 INFO L205 CegarAbsIntRunner]: [0], [1], [6], [12], [15], [41], [42], [43], [46], [48], [51], [60], [66], [69], [71], [77], [86], [90], [92], [96], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-09 19:22:56,675 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:22:56,675 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:22:56,707 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:22:56,708 INFO L272 AbstractInterpreter]: Visited 53 different actions 230 times. Merged at 21 different actions 78 times. Never widened. Performed 689 root evaluator evaluations with a maximum evaluation depth of 6. Performed 689 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 13 fixpoints after 5 different actions. Largest state had 23 variables. [2018-12-09 19:22:56,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:22:56,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:22:56,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:22:56,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:22:56,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:22:56,717 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:22:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:22:56,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:22:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-09 19:22:56,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:22:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-09 19:22:57,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:22:57,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 24 [2018-12-09 19:22:57,005 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:22:57,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 19:22:57,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 19:22:57,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2018-12-09 19:22:57,006 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 17 states. [2018-12-09 19:23:02,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:23:02,143 INFO L93 Difference]: Finished difference Result 163 states and 192 transitions. [2018-12-09 19:23:02,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 19:23:02,144 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 78 [2018-12-09 19:23:02,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:23:02,144 INFO L225 Difference]: With dead ends: 163 [2018-12-09 19:23:02,144 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 19:23:02,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 19:23:02,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 19:23:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 19:23:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 19:23:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 19:23:02,145 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2018-12-09 19:23:02,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:23:02,145 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 19:23:02,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 19:23:02,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 19:23:02,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 19:23:02,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 19:23:02,314 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 80 [2018-12-09 19:23:02,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:02,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:23:03,432 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 30 [2018-12-09 19:23:03,436 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 19:23:03,436 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 19:23:03,436 INFO L448 ceAbstractionStarter]: For program point mulfltEXIT(lines 137 209) no Hoare annotation was computed. [2018-12-09 19:23:03,436 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2018-12-09 19:23:03,436 INFO L448 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2018-12-09 19:23:03,436 INFO L448 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2018-12-09 19:23:03,436 INFO L448 ceAbstractionStarter]: For program point mulfltFINAL(lines 137 209) no Hoare annotation was computed. [2018-12-09 19:23:03,436 INFO L451 ceAbstractionStarter]: At program point mulfltENTRY(lines 137 209) the Hoare annotation is: true [2018-12-09 19:23:03,436 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2018-12-09 19:23:03,436 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-12-09 19:23:03,436 INFO L448 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2018-12-09 19:23:03,436 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2018-12-09 19:23:03,436 INFO L444 ceAbstractionStarter]: At program point L206(lines 147 208) the Hoare annotation is: (let ((.cse1 (mod |mulflt_#in~a| 4294967296)) (.cse0 (= mulflt_~__retres10~1 0))) (and (or (and (= mulflt_~a 0) (= mulflt_~b 0)) (not (= |mulflt_#in~a| 0)) (not (= |mulflt_#in~b| 0))) (or .cse0 (<= (mod mulflt_~b 4294967296) .cse1)) (or (and (= mulflt_~b |mulflt_#in~a|) (not (= .cse1 0))) .cse0 (and (exists ((mulflt_~b Int)) (let ((.cse2 (mod mulflt_~b 4294967296))) (and (<= .cse2 (mod |mulflt_#in~a| 4294967296)) (not (= .cse2 0))))) (= mulflt_~a |mulflt_#in~a|) (not (= 0 (mod |mulflt_#in~b| 4294967296))))))) [2018-12-09 19:23:03,436 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2018-12-09 19:23:03,436 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-12-09 19:23:03,436 INFO L448 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-12-09 19:23:03,436 INFO L444 ceAbstractionStarter]: At program point L69(lines 18 71) the Hoare annotation is: (or (not (= |base2flt_#in~m| 0)) (and (= base2flt_~__retres4~0 0) (= base2flt_~m 0) (= base2flt_~e 0)) (not (= |base2flt_#in~e| 0))) [2018-12-09 19:23:03,436 INFO L448 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-12-09 19:23:03,437 INFO L448 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-12-09 19:23:03,437 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-12-09 19:23:03,437 INFO L444 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: (let ((.cse0 (not (= |base2flt_#in~e| 0)))) (and (or (not (= |base2flt_#in~m| 0)) .cse0) (not (= base2flt_~m 0)) (or (and (<= base2flt_~m |base2flt_#in~m|) (<= |base2flt_#in~m| base2flt_~m) (= base2flt_~e 0)) (or (and (= base2flt_~m 2) (= (+ base2flt_~e 1) 0)) (= (mod base2flt_~m 4) 0)) (not (= |base2flt_#in~m| 1)) .cse0))) [2018-12-09 19:23:03,437 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-12-09 19:23:03,437 INFO L451 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2018-12-09 19:23:03,437 INFO L448 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2018-12-09 19:23:03,437 INFO L444 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: (let ((.cse0 (not (= |base2flt_#in~e| 0)))) (and (or (not (= |base2flt_#in~m| 0)) .cse0) (or (or (and (= base2flt_~m 2) (= (+ base2flt_~e 1) 0)) (and (not (= base2flt_~m 0)) (= (mod base2flt_~m 4) 0))) (not (= |base2flt_#in~m| 1)) .cse0))) [2018-12-09 19:23:03,437 INFO L448 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2018-12-09 19:23:03,437 INFO L444 ceAbstractionStarter]: At program point L47-2(lines 47 62) the Hoare annotation is: (let ((.cse1 (* 4 |base2flt_#in~m|)) (.cse0 (+ (div base2flt_~m 4294967296) 1))) (and (or (<= 4194304 |base2flt_#in~m|) (<= (+ |base2flt_#in~m| 1) 0)) (<= |base2flt_#in~e| base2flt_~e) (or (<= .cse0 0) (<= base2flt_~m .cse1)) (or (<= .cse1 base2flt_~m) (< 0 .cse0)))) [2018-12-09 19:23:03,437 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 19:23:03,437 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 19:23:03,437 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 19:23:03,437 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 19:23:03,437 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2018-12-09 19:23:03,437 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 210 266) no Hoare annotation was computed. [2018-12-09 19:23:03,437 INFO L448 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2018-12-09 19:23:03,437 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2018-12-09 19:23:03,437 INFO L448 ceAbstractionStarter]: For program point L246-1(lines 246 262) no Hoare annotation was computed. [2018-12-09 19:23:03,437 INFO L448 ceAbstractionStarter]: For program point L244(line 244) no Hoare annotation was computed. [2018-12-09 19:23:03,437 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 210 266) no Hoare annotation was computed. [2018-12-09 19:23:03,437 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2018-12-09 19:23:03,438 INFO L448 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2018-12-09 19:23:03,438 INFO L444 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (= 0 main_~zero~0) [2018-12-09 19:23:03,438 INFO L448 ceAbstractionStarter]: For program point L230-1(line 230) no Hoare annotation was computed. [2018-12-09 19:23:03,438 INFO L451 ceAbstractionStarter]: At program point L228(line 228) the Hoare annotation is: true [2018-12-09 19:23:03,438 INFO L448 ceAbstractionStarter]: For program point L228-1(line 228) no Hoare annotation was computed. [2018-12-09 19:23:03,438 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 210 266) the Hoare annotation is: true [2018-12-09 19:23:03,438 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2018-12-09 19:23:03,438 INFO L444 ceAbstractionStarter]: At program point L247-2(lines 247 256) the Hoare annotation is: (and (= main_~tmp___1~0 0) (= main_~zero~0 0) (= main_~tmp___0~0 0)) [2018-12-09 19:23:03,438 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2018-12-09 19:23:03,438 INFO L444 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (= 0 main_~zero~0) [2018-12-09 19:23:03,438 INFO L444 ceAbstractionStarter]: At program point L233-2(lines 233 242) the Hoare annotation is: (or (and (<= 1 main_~tmp~2) (<= 1 main_~sa~0)) (<= (+ main_~sa~0 1) 0) (and (= main_~tmp~2 0) (<= (mod main_~a~0 4294967296) 0) (= main_~sa~0 0) (= 0 main_~zero~0))) [2018-12-09 19:23:03,438 INFO L448 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-12-09 19:23:03,438 INFO L444 ceAbstractionStarter]: At program point L229(line 229) the Hoare annotation is: (= 0 main_~zero~0) [2018-12-09 19:23:03,438 INFO L448 ceAbstractionStarter]: For program point L229-1(line 229) no Hoare annotation was computed. [2018-12-09 19:23:03,438 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2018-12-09 19:23:03,438 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2018-12-09 19:23:03,438 INFO L448 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-12-09 19:23:03,438 INFO L448 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-12-09 19:23:03,438 INFO L448 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2018-12-09 19:23:03,438 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-12-09 19:23:03,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-12-09 19:23:03,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-12-09 19:23:03,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-12-09 19:23:03,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-12-09 19:23:03,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:23:03 BoogieIcfgContainer [2018-12-09 19:23:03,447 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:23:03,448 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:23:03,448 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:23:03,448 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:23:03,448 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:22:37" (3/4) ... [2018-12-09 19:23:03,450 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 19:23:03,453 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 19:23:03,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mulflt [2018-12-09 19:23:03,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2018-12-09 19:23:03,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 19:23:03,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-09 19:23:03,457 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-12-09 19:23:03,457 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-09 19:23:03,457 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 19:23:03,477 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(m) == 0) || ((__retres4 == 0 && m == 0) && e == 0)) || !(\old(e) == 0) [2018-12-09 19:23:03,477 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(m) == 0) || !(\old(e) == 0)) && !(m == 0)) && (((((m <= \old(m) && \old(m) <= m) && e == 0) || (m == 2 && e + 1 == 0) || m % 4 == 0) || !(\old(m) == 1)) || !(\old(e) == 0)) [2018-12-09 19:23:03,477 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4194304 <= \old(m) || \old(m) + 1 <= 0) && \old(e) <= e) && (m / 4294967296 + 1 <= 0 || m <= 4 * \old(m))) && (4 * \old(m) <= m || 0 < m / 4294967296 + 1) [2018-12-09 19:23:03,478 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(m) == 0) || !(\old(e) == 0)) && ((((m == 2 && e + 1 == 0) || (!(m == 0) && m % 4 == 0)) || !(\old(m) == 1)) || !(\old(e) == 0)) [2018-12-09 19:23:03,478 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((a == 0 && b == 0) || !(\old(a) == 0)) || !(\old(b) == 0)) && (__retres10 == 0 || b % 4294967296 <= \old(a) % 4294967296)) && (((b == \old(a) && !(\old(a) % 4294967296 == 0)) || __retres10 == 0) || (((\exists mulflt_~b : int :: mulflt_~b % 4294967296 <= \old(a) % 4294967296 && !(mulflt_~b % 4294967296 == 0)) && a == \old(a)) && !(0 == \old(b) % 4294967296))) [2018-12-09 19:23:03,500 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1fb2a257-3188-4d2e-a9c6-8aad5abd039b/bin-2019/utaipan/witness.graphml [2018-12-09 19:23:03,500 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:23:03,501 INFO L168 Benchmark]: Toolchain (without parser) took 26105.68 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 481.3 MB). Free memory was 953.5 MB in the beginning and 1.4 GB in the end (delta: -448.8 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:23:03,501 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:23:03,501 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.14 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 937.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:23:03,502 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 937.4 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-09 19:23:03,502 INFO L168 Benchmark]: Boogie Preprocessor took 17.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:23:03,502 INFO L168 Benchmark]: RCFGBuilder took 193.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-09 19:23:03,502 INFO L168 Benchmark]: TraceAbstraction took 25641.64 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 352.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -300.9 MB). Peak memory consumption was 617.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:23:03,503 INFO L168 Benchmark]: Witness Printer took 52.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:23:03,504 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 156.14 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 937.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 937.4 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 193.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25641.64 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 352.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -300.9 MB). Peak memory consumption was 617.7 MB. Max. memory is 11.5 GB. * Witness Printer took 52.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: 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: 25]: Loop Invariant Derived loop invariant: (!(\old(m) == 0) || !(\old(e) == 0)) && ((((m == 2 && e + 1 == 0) || (!(m == 0) && m % 4 == 0)) || !(\old(m) == 1)) || !(\old(e) == 0)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (!(\old(m) == 0) || ((__retres4 == 0 && m == 0) && e == 0)) || !(\old(e) == 0) - InvariantResult [Line: 147]: Loop Invariant [2018-12-09 19:23:03,508 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-12-09 19:23:03,508 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-12-09 19:23:03,508 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-12-09 19:23:03,508 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] Derived loop invariant: ((((a == 0 && b == 0) || !(\old(a) == 0)) || !(\old(b) == 0)) && (__retres10 == 0 || b % 4294967296 <= \old(a) % 4294967296)) && (((b == \old(a) && !(\old(a) % 4294967296 == 0)) || __retres10 == 0) || (((\exists mulflt_~b : int :: mulflt_~b % 4294967296 <= \old(a) % 4294967296 && !(mulflt_~b % 4294967296 == 0)) && a == \old(a)) && !(0 == \old(b) % 4294967296))) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((4194304 <= \old(m) || \old(m) + 1 <= 0) && \old(e) <= e) && (m / 4294967296 + 1 <= 0 || m <= 4 * \old(m))) && (4 * \old(m) <= m || 0 < m / 4294967296 + 1) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((!(\old(m) == 0) || !(\old(e) == 0)) && !(m == 0)) && (((((m <= \old(m) && \old(m) <= m) && e == 0) || (m == 2 && e + 1 == 0) || m % 4 == 0) || !(\old(m) == 1)) || !(\old(e) == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 59 locations, 1 error locations. SAFE Result, 25.5s OverallTime, 18 OverallIterations, 5 TraceHistogramMax, 19.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1104 SDtfs, 1103 SDslu, 8594 SDs, 0 SdLazy, 2588 SolverSat, 176 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 1908 GetRequests, 1453 SyntacticMatches, 18 SemanticMatches, 437 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 16 AbstIntIterations, 7 AbstIntStrong, 0.7462859152099663 AbsIntWeakeningRatio, 1.369620253164557 AbsIntAvgWeakeningVarsNumRemoved, 0.810126582278481 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 447 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 252 PreInvPairs, 759 NumberOfFragments, 268 HoareAnnotationTreeSize, 252 FomulaSimplifications, 626211218 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 18 FomulaSimplificationsInter, 50327 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1754 NumberOfCodeBlocks, 1754 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2345 ConstructedInterpolants, 66 QuantifiedInterpolants, 395868 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1650 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 36 InterpolantComputations, 3 PerfectInterpolantSequences, 1018/1534 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...