./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_dd8a98fb-d032-4145-89bc-d931881ee1a5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dd8a98fb-d032-4145-89bc-d931881ee1a5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dd8a98fb-d032-4145-89bc-d931881ee1a5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dd8a98fb-d032-4145-89bc-d931881ee1a5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_dd8a98fb-d032-4145-89bc-d931881ee1a5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dd8a98fb-d032-4145-89bc-d931881ee1a5/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 e09138f51265758a55ca4b42a17e715ba685a263 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 15:05:35,765 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:05:35,766 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:05:35,773 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:05:35,773 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:05:35,774 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:05:35,775 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:05:35,776 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:05:35,777 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:05:35,778 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:05:35,778 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:05:35,778 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:05:35,779 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:05:35,780 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:05:35,780 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:05:35,781 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:05:35,782 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:05:35,783 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:05:35,784 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:05:35,785 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:05:35,786 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:05:35,787 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:05:35,788 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:05:35,789 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:05:35,789 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:05:35,789 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:05:35,790 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:05:35,790 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:05:35,791 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:05:35,792 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:05:35,792 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:05:35,792 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:05:35,792 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:05:35,793 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:05:35,793 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:05:35,794 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:05:35,794 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dd8a98fb-d032-4145-89bc-d931881ee1a5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 15:05:35,804 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:05:35,804 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:05:35,805 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 15:05:35,805 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 15:05:35,805 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 15:05:35,805 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 15:05:35,805 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 15:05:35,805 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 15:05:35,805 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 15:05:35,805 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 15:05:35,805 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 15:05:35,805 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 15:05:35,805 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 15:05:35,806 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:05:35,806 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 15:05:35,806 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 15:05:35,806 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 15:05:35,806 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:05:35,807 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 15:05:35,807 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 15:05:35,807 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 15:05:35,807 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 15:05:35,807 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 15:05:35,807 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 15:05:35,807 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:05:35,807 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 15:05:35,808 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 15:05:35,808 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 15:05:35,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 15:05:35,808 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:05:35,808 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 15:05:35,808 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 15:05:35,808 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 15:05:35,808 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 15:05:35,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 15:05:35,808 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 15:05:35,808 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_dd8a98fb-d032-4145-89bc-d931881ee1a5/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 -> e09138f51265758a55ca4b42a17e715ba685a263 [2018-12-09 15:05:35,831 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:05:35,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:05:35,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:05:35,844 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:05:35,844 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:05:35,845 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dd8a98fb-d032-4145-89bc-d931881ee1a5/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-12-09 15:05:35,881 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd8a98fb-d032-4145-89bc-d931881ee1a5/bin-2019/utaipan/data/9f406e371/72e53e66950b465fbeb5b4315afe4765/FLAG8caf6a0ce [2018-12-09 15:05:36,305 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:05:36,306 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dd8a98fb-d032-4145-89bc-d931881ee1a5/sv-benchmarks/c/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-12-09 15:05:36,313 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd8a98fb-d032-4145-89bc-d931881ee1a5/bin-2019/utaipan/data/9f406e371/72e53e66950b465fbeb5b4315afe4765/FLAG8caf6a0ce [2018-12-09 15:05:36,321 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dd8a98fb-d032-4145-89bc-d931881ee1a5/bin-2019/utaipan/data/9f406e371/72e53e66950b465fbeb5b4315afe4765 [2018-12-09 15:05:36,323 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:05:36,324 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 15:05:36,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:05:36,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:05:36,326 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:05:36,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:05:36" (1/1) ... [2018-12-09 15:05:36,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2caf47c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:36, skipping insertion in model container [2018-12-09 15:05:36,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:05:36" (1/1) ... [2018-12-09 15:05:36,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:05:36,363 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:05:36,556 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:05:36,559 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:05:36,672 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:05:36,682 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:05:36,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:36 WrapperNode [2018-12-09 15:05:36,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:05:36,683 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 15:05:36,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 15:05:36,683 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 15:05:36,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:36" (1/1) ... [2018-12-09 15:05:36,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:36" (1/1) ... [2018-12-09 15:05:36,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 15:05:36,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:05:36,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:05:36,707 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:05:36,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:36" (1/1) ... [2018-12-09 15:05:36,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:36" (1/1) ... [2018-12-09 15:05:36,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:36" (1/1) ... [2018-12-09 15:05:36,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:36" (1/1) ... [2018-12-09 15:05:36,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:36" (1/1) ... [2018-12-09 15:05:36,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:36" (1/1) ... [2018-12-09 15:05:36,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:36" (1/1) ... [2018-12-09 15:05:36,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:05:36,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:05:36,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:05:36,760 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:05:36,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd8a98fb-d032-4145-89bc-d931881ee1a5/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 15:05:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 15:05:36,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 15:05:36,803 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-09 15:05:36,803 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-09 15:05:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:05:36,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:05:36,804 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 15:05:36,804 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 15:05:37,352 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:05:37,353 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 15:05:37,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:05:37 BoogieIcfgContainer [2018-12-09 15:05:37,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:05:37,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 15:05:37,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 15:05:37,357 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 15:05:37,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:05:36" (1/3) ... [2018-12-09 15:05:37,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd092c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:05:37, skipping insertion in model container [2018-12-09 15:05:37,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:36" (2/3) ... [2018-12-09 15:05:37,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd092c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:05:37, skipping insertion in model container [2018-12-09 15:05:37,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:05:37" (3/3) ... [2018-12-09 15:05:37,359 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label11_true-unreach-call_false-termination.c [2018-12-09 15:05:37,368 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 15:05:37,374 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 15:05:37,388 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 15:05:37,415 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 15:05:37,415 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 15:05:37,415 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 15:05:37,415 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 15:05:37,415 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 15:05:37,416 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 15:05:37,416 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 15:05:37,416 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 15:05:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2018-12-09 15:05:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 15:05:37,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:05:37,442 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:37,443 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:05:37,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:37,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1377016033, now seen corresponding path program 1 times [2018-12-09 15:05:37,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:05:37,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:37,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:05:37,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:37,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:05:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:05:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:05:37,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:05:37,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:05:37,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:05:37,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:05:37,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:05:37,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:05:37,754 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2018-12-09 15:05:38,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:05:38,197 INFO L93 Difference]: Finished difference Result 547 states and 938 transitions. [2018-12-09 15:05:38,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:05:38,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-12-09 15:05:38,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:05:38,206 INFO L225 Difference]: With dead ends: 547 [2018-12-09 15:05:38,206 INFO L226 Difference]: Without dead ends: 278 [2018-12-09 15:05:38,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 15:05:38,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-09 15:05:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-12-09 15:05:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-09 15:05:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 400 transitions. [2018-12-09 15:05:38,242 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 400 transitions. Word has length 115 [2018-12-09 15:05:38,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:05:38,243 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 400 transitions. [2018-12-09 15:05:38,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:05:38,243 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 400 transitions. [2018-12-09 15:05:38,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 15:05:38,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:05:38,245 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:38,245 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:05:38,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:38,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1300380632, now seen corresponding path program 1 times [2018-12-09 15:05:38,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:05:38,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:38,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:05:38,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:38,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:05:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:05:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:05:38,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:05:38,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:05:38,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:05:38,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:05:38,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:05:38,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:05:38,334 INFO L87 Difference]: Start difference. First operand 278 states and 400 transitions. Second operand 6 states. [2018-12-09 15:05:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:05:38,708 INFO L93 Difference]: Finished difference Result 703 states and 1026 transitions. [2018-12-09 15:05:38,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 15:05:38,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-12-09 15:05:38,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:05:38,711 INFO L225 Difference]: With dead ends: 703 [2018-12-09 15:05:38,711 INFO L226 Difference]: Without dead ends: 431 [2018-12-09 15:05:38,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:05:38,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-12-09 15:05:38,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 419. [2018-12-09 15:05:38,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-09 15:05:38,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 588 transitions. [2018-12-09 15:05:38,727 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 588 transitions. Word has length 125 [2018-12-09 15:05:38,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:05:38,727 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 588 transitions. [2018-12-09 15:05:38,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:05:38,727 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 588 transitions. [2018-12-09 15:05:38,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-09 15:05:38,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:05:38,729 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:38,729 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:05:38,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:38,729 INFO L82 PathProgramCache]: Analyzing trace with hash 860697510, now seen corresponding path program 1 times [2018-12-09 15:05:38,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:05:38,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:38,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:05:38,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:38,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:05:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:05:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:05:38,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:05:38,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:05:38,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:05:38,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:05:38,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:05:38,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:05:38,888 INFO L87 Difference]: Start difference. First operand 419 states and 588 transitions. Second operand 5 states. [2018-12-09 15:05:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:05:39,232 INFO L93 Difference]: Finished difference Result 933 states and 1337 transitions. [2018-12-09 15:05:39,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 15:05:39,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2018-12-09 15:05:39,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:05:39,234 INFO L225 Difference]: With dead ends: 933 [2018-12-09 15:05:39,234 INFO L226 Difference]: Without dead ends: 417 [2018-12-09 15:05:39,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 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 15:05:39,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-12-09 15:05:39,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-12-09 15:05:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 15:05:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 550 transitions. [2018-12-09 15:05:39,245 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 550 transitions. Word has length 126 [2018-12-09 15:05:39,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:05:39,245 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 550 transitions. [2018-12-09 15:05:39,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:05:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 550 transitions. [2018-12-09 15:05:39,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 15:05:39,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:05:39,246 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:39,247 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:05:39,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:39,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1706034196, now seen corresponding path program 1 times [2018-12-09 15:05:39,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:05:39,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:39,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:05:39,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:39,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:05:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:05:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:05:39,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:05:39,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:05:39,404 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:05:39,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:05:39,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:05:39,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:05:39,404 INFO L87 Difference]: Start difference. First operand 417 states and 550 transitions. Second operand 5 states. [2018-12-09 15:05:39,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:05:39,688 INFO L93 Difference]: Finished difference Result 912 states and 1228 transitions. [2018-12-09 15:05:39,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 15:05:39,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-12-09 15:05:39,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:05:39,689 INFO L225 Difference]: With dead ends: 912 [2018-12-09 15:05:39,689 INFO L226 Difference]: Without dead ends: 417 [2018-12-09 15:05:39,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 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 15:05:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-12-09 15:05:39,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-12-09 15:05:39,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 15:05:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 547 transitions. [2018-12-09 15:05:39,697 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 547 transitions. Word has length 127 [2018-12-09 15:05:39,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:05:39,698 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 547 transitions. [2018-12-09 15:05:39,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:05:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 547 transitions. [2018-12-09 15:05:39,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-09 15:05:39,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:05:39,699 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:39,699 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:05:39,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:39,699 INFO L82 PathProgramCache]: Analyzing trace with hash 508544498, now seen corresponding path program 1 times [2018-12-09 15:05:39,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:05:39,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:39,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:05:39,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:39,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:05:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:05:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:05:39,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:05:39,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:05:39,766 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:05:39,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:05:39,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:05:39,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:05:39,767 INFO L87 Difference]: Start difference. First operand 417 states and 547 transitions. Second operand 3 states. [2018-12-09 15:05:40,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:05:40,022 INFO L93 Difference]: Finished difference Result 1237 states and 1661 transitions. [2018-12-09 15:05:40,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:05:40,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-12-09 15:05:40,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:05:40,025 INFO L225 Difference]: With dead ends: 1237 [2018-12-09 15:05:40,025 INFO L226 Difference]: Without dead ends: 826 [2018-12-09 15:05:40,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 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 15:05:40,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2018-12-09 15:05:40,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 826. [2018-12-09 15:05:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2018-12-09 15:05:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1069 transitions. [2018-12-09 15:05:40,045 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1069 transitions. Word has length 132 [2018-12-09 15:05:40,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:05:40,046 INFO L480 AbstractCegarLoop]: Abstraction has 826 states and 1069 transitions. [2018-12-09 15:05:40,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:05:40,046 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1069 transitions. [2018-12-09 15:05:40,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-09 15:05:40,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:05:40,048 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:40,049 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:05:40,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:40,049 INFO L82 PathProgramCache]: Analyzing trace with hash -486972616, now seen corresponding path program 1 times [2018-12-09 15:05:40,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:05:40,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:40,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:05:40,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:40,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:05:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:05:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:05:40,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:05:40,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:05:40,107 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:05:40,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:05:40,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:05:40,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:05:40,107 INFO L87 Difference]: Start difference. First operand 826 states and 1069 transitions. Second operand 6 states. [2018-12-09 15:05:40,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:05:40,452 INFO L93 Difference]: Finished difference Result 2375 states and 3230 transitions. [2018-12-09 15:05:40,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 15:05:40,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2018-12-09 15:05:40,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:05:40,456 INFO L225 Difference]: With dead ends: 2375 [2018-12-09 15:05:40,456 INFO L226 Difference]: Without dead ends: 1555 [2018-12-09 15:05:40,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:05:40,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2018-12-09 15:05:40,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1531. [2018-12-09 15:05:40,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1531 states. [2018-12-09 15:05:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1927 transitions. [2018-12-09 15:05:40,487 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1927 transitions. Word has length 133 [2018-12-09 15:05:40,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:05:40,487 INFO L480 AbstractCegarLoop]: Abstraction has 1531 states and 1927 transitions. [2018-12-09 15:05:40,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:05:40,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1927 transitions. [2018-12-09 15:05:40,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-09 15:05:40,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:05:40,489 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:40,490 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:05:40,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:40,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1684411513, now seen corresponding path program 1 times [2018-12-09 15:05:40,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:05:40,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:40,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:05:40,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:40,490 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:05:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:05:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:05:40,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:05:40,551 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:05:40,551 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-12-09 15:05:40,553 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-09 15:05:40,581 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 15:05:40,581 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 15:05:40,857 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 15:05:40,858 INFO L272 AbstractInterpreter]: Visited 116 different actions 116 times. Never merged. Never widened. Performed 1543 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1543 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-12-09 15:05:40,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:40,870 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 15:05:41,064 INFO L227 lantSequenceWeakener]: Weakened 139 states. On average, predicates are now at 80.41% of their original sizes. [2018-12-09 15:05:41,064 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 15:05:41,099 INFO L418 sIntCurrentIteration]: We unified 147 AI predicates to 147 [2018-12-09 15:05:41,099 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 15:05:41,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 15:05:41,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-12-09 15:05:41,100 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:05:41,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:05:41,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:05:41,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:05:41,101 INFO L87 Difference]: Start difference. First operand 1531 states and 1927 transitions. Second operand 6 states. [2018-12-09 15:05:42,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:05:42,774 INFO L93 Difference]: Finished difference Result 3192 states and 4016 transitions. [2018-12-09 15:05:42,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:05:42,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-12-09 15:05:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:05:42,779 INFO L225 Difference]: With dead ends: 3192 [2018-12-09 15:05:42,780 INFO L226 Difference]: Without dead ends: 1667 [2018-12-09 15:05:42,782 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:05:42,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-12-09 15:05:42,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1666. [2018-12-09 15:05:42,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1666 states. [2018-12-09 15:05:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2068 transitions. [2018-12-09 15:05:42,817 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2068 transitions. Word has length 148 [2018-12-09 15:05:42,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:05:42,817 INFO L480 AbstractCegarLoop]: Abstraction has 1666 states and 2068 transitions. [2018-12-09 15:05:42,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:05:42,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2068 transitions. [2018-12-09 15:05:42,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-09 15:05:42,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:05:42,820 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:42,820 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:05:42,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:42,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1310973214, now seen corresponding path program 1 times [2018-12-09 15:05:42,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:05:42,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:42,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:05:42,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:42,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:05:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:05:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 15:05:42,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:05:42,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:05:42,886 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2018-12-09 15:05:42,886 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-09 15:05:42,889 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 15:05:42,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 15:05:43,069 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 15:05:43,069 INFO L272 AbstractInterpreter]: Visited 120 different actions 234 times. Merged at 4 different actions 4 times. Never widened. Performed 3083 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3083 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-12-09 15:05:43,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:43,071 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 15:05:43,209 INFO L227 lantSequenceWeakener]: Weakened 153 states. On average, predicates are now at 81.82% of their original sizes. [2018-12-09 15:05:43,209 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 15:05:43,250 INFO L418 sIntCurrentIteration]: We unified 155 AI predicates to 155 [2018-12-09 15:05:43,250 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 15:05:43,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 15:05:43,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-09 15:05:43,250 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:05:43,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 15:05:43,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 15:05:43,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-09 15:05:43,251 INFO L87 Difference]: Start difference. First operand 1666 states and 2068 transitions. Second operand 10 states. [2018-12-09 15:05:45,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:05:45,411 INFO L93 Difference]: Finished difference Result 3330 states and 4160 transitions. [2018-12-09 15:05:45,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 15:05:45,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2018-12-09 15:05:45,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:05:45,416 INFO L225 Difference]: With dead ends: 3330 [2018-12-09 15:05:45,417 INFO L226 Difference]: Without dead ends: 1805 [2018-12-09 15:05:45,419 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 163 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-09 15:05:45,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2018-12-09 15:05:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1803. [2018-12-09 15:05:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2018-12-09 15:05:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2215 transitions. [2018-12-09 15:05:45,454 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2215 transitions. Word has length 156 [2018-12-09 15:05:45,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:05:45,454 INFO L480 AbstractCegarLoop]: Abstraction has 1803 states and 2215 transitions. [2018-12-09 15:05:45,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 15:05:45,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2215 transitions. [2018-12-09 15:05:45,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-09 15:05:45,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:05:45,457 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:45,457 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:05:45,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:45,457 INFO L82 PathProgramCache]: Analyzing trace with hash -421933084, now seen corresponding path program 1 times [2018-12-09 15:05:45,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:05:45,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:45,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:05:45,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:45,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:05:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:05:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 82 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 15:05:45,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:05:45,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:05:45,531 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-12-09 15:05:45,531 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-09 15:05:45,534 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 15:05:45,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 15:05:45,641 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 15:05:45,641 INFO L272 AbstractInterpreter]: Visited 120 different actions 234 times. Merged at 4 different actions 4 times. Never widened. Performed 3143 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3143 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-12-09 15:05:45,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:45,646 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 15:05:45,784 INFO L227 lantSequenceWeakener]: Weakened 186 states. On average, predicates are now at 81.78% of their original sizes. [2018-12-09 15:05:45,784 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 15:05:45,838 INFO L418 sIntCurrentIteration]: We unified 188 AI predicates to 188 [2018-12-09 15:05:45,838 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 15:05:45,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 15:05:45,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-09 15:05:45,838 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:05:45,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 15:05:45,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 15:05:45,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-09 15:05:45,839 INFO L87 Difference]: Start difference. First operand 1803 states and 2215 transitions. Second operand 10 states. [2018-12-09 15:05:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:05:47,902 INFO L93 Difference]: Finished difference Result 3741 states and 4627 transitions. [2018-12-09 15:05:47,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 15:05:47,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2018-12-09 15:05:47,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:05:47,906 INFO L225 Difference]: With dead ends: 3741 [2018-12-09 15:05:47,906 INFO L226 Difference]: Without dead ends: 2216 [2018-12-09 15:05:47,908 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 197 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-12-09 15:05:47,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2018-12-09 15:05:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2214. [2018-12-09 15:05:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states. [2018-12-09 15:05:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 2648 transitions. [2018-12-09 15:05:47,939 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 2648 transitions. Word has length 189 [2018-12-09 15:05:47,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:05:47,939 INFO L480 AbstractCegarLoop]: Abstraction has 2214 states and 2648 transitions. [2018-12-09 15:05:47,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 15:05:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 2648 transitions. [2018-12-09 15:05:47,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-09 15:05:47,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:05:47,942 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:47,942 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:05:47,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:47,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1573168407, now seen corresponding path program 1 times [2018-12-09 15:05:47,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:05:47,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:47,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:05:47,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:47,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:05:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:05:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 79 proven. 38 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-09 15:05:48,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:05:48,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:05:48,027 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 198 with the following transitions: [2018-12-09 15:05:48,027 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-09 15:05:48,030 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 15:05:48,030 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 15:05:48,308 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 15:05:48,308 INFO L272 AbstractInterpreter]: Visited 122 different actions 483 times. Merged at 8 different actions 28 times. Never widened. Performed 6832 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6832 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 2 different actions. Largest state had 42 variables. [2018-12-09 15:05:48,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:48,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 15:05:48,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:05:48,311 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd8a98fb-d032-4145-89bc-d931881ee1a5/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 15:05:48,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:05:48,320 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 15:05:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:05:48,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:05:48,439 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 96 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-09 15:05:48,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:05:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 84 proven. 31 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-09 15:05:48,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:05:48,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-12-09 15:05:48,602 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:05:48,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 15:05:48,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 15:05:48,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-09 15:05:48,603 INFO L87 Difference]: Start difference. First operand 2214 states and 2648 transitions. Second operand 11 states. [2018-12-09 15:05:49,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:05:49,596 INFO L93 Difference]: Finished difference Result 6527 states and 8187 transitions. [2018-12-09 15:05:49,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 15:05:49,596 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 197 [2018-12-09 15:05:49,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:05:49,604 INFO L225 Difference]: With dead ends: 6527 [2018-12-09 15:05:49,604 INFO L226 Difference]: Without dead ends: 4865 [2018-12-09 15:05:49,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 397 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-12-09 15:05:49,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4865 states. [2018-12-09 15:05:49,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4865 to 4859. [2018-12-09 15:05:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4859 states. [2018-12-09 15:05:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4859 states to 4859 states and 5874 transitions. [2018-12-09 15:05:49,681 INFO L78 Accepts]: Start accepts. Automaton has 4859 states and 5874 transitions. Word has length 197 [2018-12-09 15:05:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:05:49,681 INFO L480 AbstractCegarLoop]: Abstraction has 4859 states and 5874 transitions. [2018-12-09 15:05:49,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 15:05:49,681 INFO L276 IsEmpty]: Start isEmpty. Operand 4859 states and 5874 transitions. [2018-12-09 15:05:49,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-09 15:05:49,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:05:49,686 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:49,686 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:05:49,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:49,687 INFO L82 PathProgramCache]: Analyzing trace with hash 924757225, now seen corresponding path program 1 times [2018-12-09 15:05:49,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:05:49,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:49,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:05:49,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:49,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:05:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:05:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 124 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-09 15:05:49,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:05:49,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:05:49,775 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-12-09 15:05:49,775 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-09 15:05:49,777 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 15:05:49,777 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 15:05:49,938 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 15:05:49,938 INFO L272 AbstractInterpreter]: Visited 121 different actions 355 times. Merged at 6 different actions 12 times. Never widened. Performed 4710 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4710 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-12-09 15:05:49,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:49,939 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 15:05:50,121 INFO L227 lantSequenceWeakener]: Weakened 203 states. On average, predicates are now at 83.4% of their original sizes. [2018-12-09 15:05:50,122 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 15:05:50,157 INFO L418 sIntCurrentIteration]: We unified 205 AI predicates to 205 [2018-12-09 15:05:50,157 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 15:05:50,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 15:05:50,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-09 15:05:50,157 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:05:50,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 15:05:50,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 15:05:50,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-09 15:05:50,158 INFO L87 Difference]: Start difference. First operand 4859 states and 5874 transitions. Second operand 10 states. [2018-12-09 15:05:51,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:05:51,742 INFO L93 Difference]: Finished difference Result 9716 states and 11842 transitions. [2018-12-09 15:05:51,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 15:05:51,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 206 [2018-12-09 15:05:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:05:51,750 INFO L225 Difference]: With dead ends: 9716 [2018-12-09 15:05:51,750 INFO L226 Difference]: Without dead ends: 5546 [2018-12-09 15:05:51,754 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 213 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-09 15:05:51,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5546 states. [2018-12-09 15:05:51,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5546 to 5542. [2018-12-09 15:05:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5542 states. [2018-12-09 15:05:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5542 states to 5542 states and 6640 transitions. [2018-12-09 15:05:51,822 INFO L78 Accepts]: Start accepts. Automaton has 5542 states and 6640 transitions. Word has length 206 [2018-12-09 15:05:51,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:05:51,822 INFO L480 AbstractCegarLoop]: Abstraction has 5542 states and 6640 transitions. [2018-12-09 15:05:51,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 15:05:51,822 INFO L276 IsEmpty]: Start isEmpty. Operand 5542 states and 6640 transitions. [2018-12-09 15:05:51,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-09 15:05:51,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:05:51,828 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:51,828 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:05:51,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:51,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1274612791, now seen corresponding path program 1 times [2018-12-09 15:05:51,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:05:51,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:51,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:05:51,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:51,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:05:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:05:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 150 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-09 15:05:51,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:05:51,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:05:51,896 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-12-09 15:05:51,896 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-09 15:05:51,898 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 15:05:51,898 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 15:05:52,143 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 15:05:52,143 INFO L272 AbstractInterpreter]: Visited 122 different actions 483 times. Merged at 8 different actions 28 times. Never widened. Performed 6983 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6983 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-09 15:05:52,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:52,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 15:05:52,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:05:52,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd8a98fb-d032-4145-89bc-d931881ee1a5/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 15:05:52,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:05:52,151 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 15:05:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:05:52,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:05:52,238 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 134 proven. 14 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-09 15:05:52,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:05:52,298 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 146 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-09 15:05:52,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:05:52,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2018-12-09 15:05:52,313 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:05:52,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 15:05:52,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 15:05:52,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:05:52,314 INFO L87 Difference]: Start difference. First operand 5542 states and 6640 transitions. Second operand 8 states. [2018-12-09 15:05:53,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:05:53,134 INFO L93 Difference]: Finished difference Result 10656 states and 13230 transitions. [2018-12-09 15:05:53,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 15:05:53,135 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 222 [2018-12-09 15:05:53,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:05:53,147 INFO L225 Difference]: With dead ends: 10656 [2018-12-09 15:05:53,147 INFO L226 Difference]: Without dead ends: 6486 [2018-12-09 15:05:53,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 453 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-12-09 15:05:53,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6486 states. [2018-12-09 15:05:53,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6486 to 5741. [2018-12-09 15:05:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5741 states. [2018-12-09 15:05:53,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5741 states to 5741 states and 6750 transitions. [2018-12-09 15:05:53,226 INFO L78 Accepts]: Start accepts. Automaton has 5741 states and 6750 transitions. Word has length 222 [2018-12-09 15:05:53,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:05:53,226 INFO L480 AbstractCegarLoop]: Abstraction has 5741 states and 6750 transitions. [2018-12-09 15:05:53,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 15:05:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 5741 states and 6750 transitions. [2018-12-09 15:05:53,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-12-09 15:05:53,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:05:53,232 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:53,232 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:05:53,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:53,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1436750508, now seen corresponding path program 1 times [2018-12-09 15:05:53,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:05:53,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:53,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:05:53,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:53,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:05:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:05:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 178 proven. 69 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-09 15:05:53,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:05:53,330 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:05:53,330 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-12-09 15:05:53,330 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [53], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-09 15:05:53,332 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 15:05:53,332 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 15:05:53,578 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 15:05:53,579 INFO L272 AbstractInterpreter]: Visited 123 different actions 488 times. Merged at 9 different actions 29 times. Widened at 1 different actions 1 times. Performed 7015 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7015 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-09 15:05:53,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:53,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 15:05:53,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:05:53,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd8a98fb-d032-4145-89bc-d931881ee1a5/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 15:05:53,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:05:53,586 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 15:05:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:05:53,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:05:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 188 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-09 15:05:53,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:05:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 188 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-09 15:05:53,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:05:53,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2018-12-09 15:05:53,744 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:05:53,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 15:05:53,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 15:05:53,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-09 15:05:53,745 INFO L87 Difference]: Start difference. First operand 5741 states and 6750 transitions. Second operand 12 states. [2018-12-09 15:05:55,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:05:55,279 INFO L93 Difference]: Finished difference Result 11379 states and 14550 transitions. [2018-12-09 15:05:55,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-09 15:05:55,280 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 242 [2018-12-09 15:05:55,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:05:55,300 INFO L225 Difference]: With dead ends: 11379 [2018-12-09 15:05:55,300 INFO L226 Difference]: Without dead ends: 6603 [2018-12-09 15:05:55,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=425, Invalid=1831, Unknown=0, NotChecked=0, Total=2256 [2018-12-09 15:05:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6603 states. [2018-12-09 15:05:55,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6603 to 5465. [2018-12-09 15:05:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5465 states. [2018-12-09 15:05:55,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5465 states to 5465 states and 6307 transitions. [2018-12-09 15:05:55,397 INFO L78 Accepts]: Start accepts. Automaton has 5465 states and 6307 transitions. Word has length 242 [2018-12-09 15:05:55,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:05:55,397 INFO L480 AbstractCegarLoop]: Abstraction has 5465 states and 6307 transitions. [2018-12-09 15:05:55,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 15:05:55,397 INFO L276 IsEmpty]: Start isEmpty. Operand 5465 states and 6307 transitions. [2018-12-09 15:05:55,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-09 15:05:55,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:05:55,403 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:55,403 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:05:55,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:55,403 INFO L82 PathProgramCache]: Analyzing trace with hash 2001996586, now seen corresponding path program 1 times [2018-12-09 15:05:55,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:05:55,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:55,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:05:55,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:05:55,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:05:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:05:55,720 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 148 proven. 103 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 15:05:55,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:05:55,720 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:05:55,720 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 245 with the following transitions: [2018-12-09 15:05:55,720 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-09 15:05:55,722 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 15:05:55,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 15:05:56,007 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 15:05:56,007 INFO L272 AbstractInterpreter]: Visited 123 different actions 608 times. Merged at 8 different actions 37 times. Never widened. Performed 8472 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8472 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 2 different actions. Largest state had 42 variables. [2018-12-09 15:05:56,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:05:56,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 15:05:56,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:05:56,009 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd8a98fb-d032-4145-89bc-d931881ee1a5/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 15:05:56,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:05:56,015 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 15:05:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:05:56,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:05:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 183 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-12-09 15:05:56,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:05:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 183 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-12-09 15:05:56,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:05:56,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 19 [2018-12-09 15:05:56,185 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:05:56,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 15:05:56,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 15:05:56,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-12-09 15:05:56,186 INFO L87 Difference]: Start difference. First operand 5465 states and 6307 transitions. Second operand 17 states. [2018-12-09 15:05:59,571 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2018-12-09 15:05:59,859 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2018-12-09 15:06:00,936 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2018-12-09 15:06:01,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:06:01,738 INFO L93 Difference]: Finished difference Result 10420 states and 12102 transitions. [2018-12-09 15:06:01,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-09 15:06:01,739 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 244 [2018-12-09 15:06:01,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:06:01,739 INFO L225 Difference]: With dead ends: 10420 [2018-12-09 15:06:01,739 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 15:06:01,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 523 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1822 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1090, Invalid=4610, Unknown=0, NotChecked=0, Total=5700 [2018-12-09 15:06:01,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 15:06:01,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 15:06:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 15:06:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 15:06:01,752 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 244 [2018-12-09 15:06:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:06:01,753 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 15:06:01,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 15:06:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 15:06:01,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 15:06:01,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 15:06:01,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:01,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:01,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:01,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:01,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:01,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:01,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:01,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:01,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:01,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:01,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:01,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:01,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,131 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 361 DAG size of output: 272 [2018-12-09 15:06:02,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 15:06:02,350 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 373 DAG size of output: 281 [2018-12-09 15:06:03,578 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 256 DAG size of output: 92 [2018-12-09 15:06:04,218 WARN L180 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 262 DAG size of output: 72 [2018-12-09 15:06:05,132 WARN L180 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 72 [2018-12-09 15:06:05,133 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a17~0 |old(~a17~0)|) (= |old(~a7~0)| ~a7~0) (= ~a8~0 |old(~a8~0)|) (= |old(~a16~0)| ~a16~0) (= ~a20~0 |old(~a20~0)|) (= ~a21~0 |old(~a21~0)|)) [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,134 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 503) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,135 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-12-09 15:06:05,136 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-12-09 15:06:05,137 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,138 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,139 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,139 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,139 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,139 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-12-09 15:06:05,139 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-12-09 15:06:05,139 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-12-09 15:06:05,139 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-12-09 15:06:05,139 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-12-09 15:06:05,139 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-12-09 15:06:05,139 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-12-09 15:06:05,139 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-12-09 15:06:05,139 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-12-09 15:06:05,139 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-12-09 15:06:05,139 INFO L444 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse7 (= 4 |old(~a16~0)|)) (.cse23 (= ~a21~0 |old(~a21~0)|)) (.cse10 (= 1 |old(~a17~0)|)) (.cse24 (= 1 |old(~a20~0)|)) (.cse14 (= ~a17~0 |old(~a17~0)|)) (.cse15 (= |old(~a7~0)| ~a7~0)) (.cse16 (= ~a16~0 |old(~a16~0)|)) (.cse22 (= ~a8~0 |old(~a8~0)|)) (.cse19 (= 1 ~a21~0)) (.cse17 (= ~a20~0 |old(~a20~0)|))) (let ((.cse9 (< |old(~a8~0)| 14)) (.cse2 (not (= 15 |old(~a8~0)|))) (.cse3 (and .cse14 .cse15 .cse16 .cse22 .cse19 .cse17)) (.cse6 (= 6 |old(~a16~0)|)) (.cse5 (< 0 |old(~a20~0)|)) (.cse0 (not (= 1 |old(~a21~0)|))) (.cse11 (not .cse24)) (.cse18 (= 13 ~a8~0)) (.cse20 (not (= 13 |old(~a8~0)|))) (.cse21 (not .cse10)) (.cse8 (and .cse23 .cse14 .cse15 .cse16 .cse22 .cse17)) (.cse12 (< 0 |old(~a21~0)|)) (.cse1 (= 1 |old(~a7~0)|)) (.cse13 (not .cse7)) (.cse4 (not (= 8 ~a12~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8 .cse9 .cse4 .cse10) (or (or .cse6 .cse11 .cse12) .cse8 .cse4) (or .cse1 .cse11 .cse13 .cse4 (and .cse14 (<= ~a21~0 |old(~a21~0)|) .cse15 .cse16 (<= |old(~a8~0)| ~a8~0) .cse17)) (or .cse0 .cse1 .cse11 .cse13 .cse4 (and .cse18 .cse19) .cse20) (or .cse6 .cse9 .cse8 .cse4 .cse10 .cse5) (or .cse6 .cse0 .cse1 .cse7 .cse2 .cse4 .cse3) (or .cse1 .cse7 .cse11 .cse8 .cse4 .cse21) (or (not .cse6) .cse0 .cse1 .cse2 .cse3 (not (= |old(~a20~0)| 1)) .cse4) (or (and .cse22 (and .cse14 .cse15 .cse16 .cse17) .cse23) (or .cse1 .cse13 .cse4 .cse10)) (or .cse6 .cse8 .cse4 .cse12 .cse5) (or .cse0 .cse11 .cse13 (and (= 1 ~a7~0) (= 1 ~a20~0) .cse18 (= |old(~a16~0)| ~a16~0) .cse19 (= 1 ~a17~0)) .cse4 (not .cse1) .cse20 .cse21) (or .cse7 .cse8 .cse4 (< |old(~a20~0)| 1) .cse10 .cse12) (or (or .cse1 .cse13 .cse4 .cse24 (< |old(~a8~0)| 15)) (and (and .cse14 .cse15 .cse16) .cse22 .cse17 .cse23))))) [2018-12-09 15:06:05,139 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-12-09 15:06:05,139 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,139 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,139 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,139 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,139 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-12-09 15:06:05,139 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-09 15:06:05,140 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 15:06:05,141 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= 1 ~a21~0) (= ~a12~0 8) (= ~a20~0 1) (= 15 ~a8~0) (= 1 ~a17~0) (= ~a16~0 5)) [2018-12-09 15:06:05,141 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 15:06:05,142 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 15:06:05,142 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|)) (and (= 1 ~a21~0) (= ~a17~0 |old(~a17~0)|) (= |old(~a7~0)| ~a7~0) (= ~a8~0 |old(~a8~0)|) (= ~a20~0 1) (= ~a16~0 5)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|))) [2018-12-09 15:06:05,142 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-12-09 15:06:05,142 INFO L444 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse7 (<= 14 ~a8~0)) (.cse3 (not (= ~a16~0 6))) (.cse10 (= 1 ~a20~0)) (.cse11 (= 1 ~a17~0)) (.cse8 (<= ~a20~0 0)) (.cse9 (<= ~a21~0 0)) (.cse2 (not (= ~a17~0 1))) (.cse6 (not .cse1)) (.cse0 (not (= ~a7~0 1))) (.cse12 (= |old(~a20~0)| ~a20~0)) (.cse4 (= 1 ~a21~0)) (.cse5 (= 15 ~a8~0))) (or (not (= 1 |old(~a21~0)|)) (and .cse0 .cse1 .cse2) (not (= 8 ~a12~0)) (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (and (and .cse0 .cse3) .cse4 .cse5) (and (and .cse3 .cse2 .cse6) .cse7) (and .cse0 (<= 15 ~a8~0) .cse1) (and .cse7 .cse3 .cse2 .cse8) (and .cse9 .cse3 .cse8) (and .cse9 .cse10 .cse3) (and .cse10 (= 13 ~a8~0) (= 4 ~a16~0) .cse4 .cse11) (and .cse0 .cse12 .cse11) (and .cse4 (and .cse0 .cse8) .cse5) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and .cse9 .cse2 .cse6 (<= 1 ~a20~0)) (and .cse0 .cse12 .cse4 .cse5)))) [2018-12-09 15:06:05,142 INFO L448 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-12-09 15:06:05,142 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-12-09 15:06:05,142 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse7 (<= 14 ~a8~0)) (.cse3 (not (= ~a16~0 6))) (.cse10 (= 1 ~a20~0)) (.cse11 (= 1 ~a17~0)) (.cse8 (<= ~a20~0 0)) (.cse9 (<= ~a21~0 0)) (.cse2 (not (= ~a17~0 1))) (.cse6 (not .cse1)) (.cse0 (not (= ~a7~0 1))) (.cse12 (= |old(~a20~0)| ~a20~0)) (.cse4 (= 1 ~a21~0)) (.cse5 (= 15 ~a8~0))) (or (not (= 1 |old(~a21~0)|)) (and .cse0 .cse1 .cse2) (not (= 8 ~a12~0)) (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (and (and .cse0 .cse3) .cse4 .cse5) (and (and .cse3 .cse2 .cse6) .cse7) (and .cse0 (<= 15 ~a8~0) .cse1) (and .cse7 .cse3 .cse2 .cse8) (and .cse9 .cse3 .cse8) (and .cse9 .cse10 .cse3) (and .cse10 (= 13 ~a8~0) (= 4 ~a16~0) .cse4 .cse11) (and .cse0 .cse12 .cse11) (and .cse4 (and .cse0 .cse8) .cse5) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and .cse9 .cse2 .cse6 (<= 1 ~a20~0)) (and .cse0 .cse12 .cse4 .cse5)))) [2018-12-09 15:06:05,142 INFO L448 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2018-12-09 15:06:05,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:06:05 BoogieIcfgContainer [2018-12-09 15:06:05,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 15:06:05,149 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 15:06:05,149 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 15:06:05,150 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 15:06:05,150 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:05:37" (3/4) ... [2018-12-09 15:06:05,152 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 15:06:05,155 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 15:06:05,156 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-12-09 15:06:05,156 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 15:06:05,162 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-09 15:06:05,162 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 15:06:05,180 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(1 == \old(a21)) || ((!(a7 == 1) && a16 == 4) && !(a17 == 1))) || !(8 == a12)) || !(1 == \old(a20))) || !(5 == \old(a16))) || (((!(a7 == 1) && !(a16 == 6)) && 1 == a21) && 15 == a8)) || (((!(a16 == 6) && !(a17 == 1)) && !(a16 == 4)) && 14 <= a8)) || ((!(a7 == 1) && 15 <= a8) && a16 == 4)) || (((14 <= a8 && !(a16 == 6)) && !(a17 == 1)) && a20 <= 0)) || ((a21 <= 0 && !(a16 == 6)) && a20 <= 0)) || ((a21 <= 0 && 1 == a20) && !(a16 == 6))) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || ((!(a7 == 1) && \old(a20) == a20) && 1 == a17)) || ((1 == a21 && !(a7 == 1) && a20 <= 0) && 15 == a8)) || !(0 == \old(a7))) || !(1 == \old(a17))) || !(15 == \old(a8))) || (((a21 <= 0 && !(a17 == 1)) && !(a16 == 4)) && 1 <= a20)) || (((!(a7 == 1) && \old(a20) == a20) && 1 == a21) && 15 == a8) [2018-12-09 15:06:05,225 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_dd8a98fb-d032-4145-89bc-d931881ee1a5/bin-2019/utaipan/witness.graphml [2018-12-09 15:06:05,225 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 15:06:05,226 INFO L168 Benchmark]: Toolchain (without parser) took 28902.34 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 946.3 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 216.1 MB. Max. memory is 11.5 GB. [2018-12-09 15:06:05,226 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:06:05,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. [2018-12-09 15:06:05,226 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 15:06:05,227 INFO L168 Benchmark]: Boogie Preprocessor took 52.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 15:06:05,227 INFO L168 Benchmark]: RCFGBuilder took 593.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 979.6 MB in the end (delta: 99.0 MB). Peak memory consumption was 99.0 MB. Max. memory is 11.5 GB. [2018-12-09 15:06:05,227 INFO L168 Benchmark]: TraceAbstraction took 27795.54 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 974.2 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-09 15:06:05,227 INFO L168 Benchmark]: Witness Printer took 75.90 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 21.5 kB). Peak memory consumption was 21.5 kB. Max. memory is 11.5 GB. [2018-12-09 15:06:05,228 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 358.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 593.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 979.6 MB in the end (delta: 99.0 MB). Peak memory consumption was 99.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27795.54 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 974.2 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 75.90 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 21.5 kB). Peak memory consumption was 21.5 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 503]: 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: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((!(1 == \old(a21)) || ((!(a7 == 1) && a16 == 4) && !(a17 == 1))) || !(8 == a12)) || !(1 == \old(a20))) || !(5 == \old(a16))) || (((!(a7 == 1) && !(a16 == 6)) && 1 == a21) && 15 == a8)) || (((!(a16 == 6) && !(a17 == 1)) && !(a16 == 4)) && 14 <= a8)) || ((!(a7 == 1) && 15 <= a8) && a16 == 4)) || (((14 <= a8 && !(a16 == 6)) && !(a17 == 1)) && a20 <= 0)) || ((a21 <= 0 && !(a16 == 6)) && a20 <= 0)) || ((a21 <= 0 && 1 == a20) && !(a16 == 6))) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || ((!(a7 == 1) && \old(a20) == a20) && 1 == a17)) || ((1 == a21 && !(a7 == 1) && a20 <= 0) && 15 == a8)) || !(0 == \old(a7))) || !(1 == \old(a17))) || !(15 == \old(a8))) || (((a21 <= 0 && !(a17 == 1)) && !(a16 == 4)) && 1 <= a20)) || (((!(a7 == 1) && \old(a20) == a20) && 1 == a21) && 15 == a8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. SAFE Result, 27.7s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 18.5s AutomataDifference, 0.0s DeadEndRemovalTime, 3.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 752 SDtfs, 13243 SDslu, 1097 SDs, 0 SdLazy, 13396 SolverSat, 2345 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 2804 GetRequests, 2552 SyntacticMatches, 17 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5741occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.8s AbstIntTime, 8 AbstIntIterations, 4 AbstIntStrong, 0.9968725649768959 AbsIntWeakeningRatio, 0.23597122302158274 AbsIntAvgWeakeningVarsNumRemoved, 28.54820143884892 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 1934 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 250 PreInvPairs, 364 NumberOfFragments, 1012 HoareAnnotationTreeSize, 250 FomulaSimplifications, 40324 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 40189 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 3267 NumberOfCodeBlocks, 3267 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4150 ConstructedInterpolants, 0 QuantifiedInterpolants, 2740419 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2554 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 2885/3188 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...