./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label55_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_80653483-6bb4-431d-9f2a-e5b670863136/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_80653483-6bb4-431d-9f2a-e5b670863136/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_80653483-6bb4-431d-9f2a-e5b670863136/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_80653483-6bb4-431d-9f2a-e5b670863136/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label55_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_80653483-6bb4-431d-9f2a-e5b670863136/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_80653483-6bb4-431d-9f2a-e5b670863136/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 f7581b03dc5e38c896dc44d57a6d1677c5f9e4cd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 14:40:50,612 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:40:50,614 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:40:50,622 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:40:50,623 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:40:50,623 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:40:50,625 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:40:50,626 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:40:50,627 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:40:50,628 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:40:50,629 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:40:50,629 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:40:50,630 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:40:50,631 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:40:50,631 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:40:50,632 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:40:50,632 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:40:50,634 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:40:50,635 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:40:50,636 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:40:50,637 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:40:50,638 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:40:50,640 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:40:50,640 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:40:50,640 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:40:50,641 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:40:50,642 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:40:50,642 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:40:50,643 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:40:50,643 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:40:50,644 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:40:50,644 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:40:50,644 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:40:50,645 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:40:50,645 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:40:50,646 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:40:50,646 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_80653483-6bb4-431d-9f2a-e5b670863136/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 14:40:50,657 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:40:50,657 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:40:50,657 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 14:40:50,658 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 14:40:50,658 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 14:40:50,658 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 14:40:50,658 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 14:40:50,658 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 14:40:50,658 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 14:40:50,658 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 14:40:50,659 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 14:40:50,659 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 14:40:50,659 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 14:40:50,659 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:40:50,659 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:40:50,660 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:40:50,660 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:40:50,660 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:40:50,660 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 14:40:50,660 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 14:40:50,660 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 14:40:50,660 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:40:50,661 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:40:50,661 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:40:50,661 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 14:40:50,661 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:40:50,661 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:40:50,661 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 14:40:50,661 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 14:40:50,662 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:40:50,662 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:40:50,662 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 14:40:50,662 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 14:40:50,662 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 14:40:50,662 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 14:40:50,662 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 14:40:50,662 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 14:40:50,663 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_80653483-6bb4-431d-9f2a-e5b670863136/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 -> f7581b03dc5e38c896dc44d57a6d1677c5f9e4cd [2018-11-18 14:40:50,685 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:40:50,692 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:40:50,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:40:50,696 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:40:50,696 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:40:50,696 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_80653483-6bb4-431d-9f2a-e5b670863136/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label55_true-unreach-call_false-termination.c [2018-11-18 14:40:50,731 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_80653483-6bb4-431d-9f2a-e5b670863136/bin-2019/utaipan/data/f1f22c371/1aef934ba81c4a27b41b758d0be72eb8/FLAGc5cdf3ccb [2018-11-18 14:40:51,186 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:40:51,187 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_80653483-6bb4-431d-9f2a-e5b670863136/sv-benchmarks/c/eca-rers2012/Problem02_label55_true-unreach-call_false-termination.c [2018-11-18 14:40:51,196 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_80653483-6bb4-431d-9f2a-e5b670863136/bin-2019/utaipan/data/f1f22c371/1aef934ba81c4a27b41b758d0be72eb8/FLAGc5cdf3ccb [2018-11-18 14:40:51,208 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_80653483-6bb4-431d-9f2a-e5b670863136/bin-2019/utaipan/data/f1f22c371/1aef934ba81c4a27b41b758d0be72eb8 [2018-11-18 14:40:51,210 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:40:51,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:40:51,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:40:51,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:40:51,214 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:40:51,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:40:51" (1/1) ... [2018-11-18 14:40:51,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411459c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:51, skipping insertion in model container [2018-11-18 14:40:51,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:40:51" (1/1) ... [2018-11-18 14:40:51,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:40:51,260 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:40:51,468 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:40:51,471 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:40:51,536 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:40:51,548 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:40:51,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:51 WrapperNode [2018-11-18 14:40:51,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:40:51,549 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:40:51,549 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:40:51,550 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:40:51,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:51" (1/1) ... [2018-11-18 14:40:51,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:51" (1/1) ... [2018-11-18 14:40:51,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:40:51,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:40:51,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:40:51,622 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:40:51,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:51" (1/1) ... [2018-11-18 14:40:51,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:51" (1/1) ... [2018-11-18 14:40:51,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:51" (1/1) ... [2018-11-18 14:40:51,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:51" (1/1) ... [2018-11-18 14:40:51,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:51" (1/1) ... [2018-11-18 14:40:51,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:51" (1/1) ... [2018-11-18 14:40:51,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:51" (1/1) ... [2018-11-18 14:40:51,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:40:51,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:40:51,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:40:51,672 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:40:51,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80653483-6bb4-431d-9f2a-e5b670863136/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-11-18 14:40:51,710 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 14:40:51,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 14:40:51,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 14:40:51,711 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-18 14:40:51,711 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-18 14:40:51,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:40:51,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:40:51,711 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 14:40:51,711 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 14:40:52,445 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:40:52,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:40:52 BoogieIcfgContainer [2018-11-18 14:40:52,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:40:52,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 14:40:52,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 14:40:52,449 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 14:40:52,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:40:51" (1/3) ... [2018-11-18 14:40:52,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b00409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:40:52, skipping insertion in model container [2018-11-18 14:40:52,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:51" (2/3) ... [2018-11-18 14:40:52,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b00409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:40:52, skipping insertion in model container [2018-11-18 14:40:52,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:40:52" (3/3) ... [2018-11-18 14:40:52,451 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label55_true-unreach-call_false-termination.c [2018-11-18 14:40:52,457 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 14:40:52,465 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 14:40:52,473 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 14:40:52,495 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 14:40:52,495 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 14:40:52,495 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 14:40:52,495 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:40:52,495 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:40:52,495 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 14:40:52,496 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:40:52,496 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 14:40:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-18 14:40:52,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 14:40:52,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:52,520 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 14:40:52,522 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:52,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:52,526 INFO L82 PathProgramCache]: Analyzing trace with hash -301102600, now seen corresponding path program 1 times [2018-11-18 14:40:52,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:40:52,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:52,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:52,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:52,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:40:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:40:52,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:40:52,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:40:52,813 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:40:52,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:40:52,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:40:52,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:40:52,827 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-18 14:40:53,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:53,383 INFO L93 Difference]: Finished difference Result 627 states and 1072 transitions. [2018-11-18 14:40:53,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:40:53,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-11-18 14:40:53,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:53,393 INFO L225 Difference]: With dead ends: 627 [2018-11-18 14:40:53,393 INFO L226 Difference]: Without dead ends: 388 [2018-11-18 14:40:53,396 INFO L604 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-11-18 14:40:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-11-18 14:40:53,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2018-11-18 14:40:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-11-18 14:40:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 619 transitions. [2018-11-18 14:40:53,436 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 619 transitions. Word has length 112 [2018-11-18 14:40:53,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:53,437 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 619 transitions. [2018-11-18 14:40:53,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:40:53,437 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 619 transitions. [2018-11-18 14:40:53,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 14:40:53,440 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:53,440 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 14:40:53,441 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:53,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:53,441 INFO L82 PathProgramCache]: Analyzing trace with hash 178328325, now seen corresponding path program 1 times [2018-11-18 14:40:53,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:40:53,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:53,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:53,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:53,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:40:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:53,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:40:53,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:40:53,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:40:53,654 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:40:53,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:40:53,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:40:53,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:40:53,657 INFO L87 Difference]: Start difference. First operand 383 states and 619 transitions. Second operand 5 states. [2018-11-18 14:40:54,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:54,262 INFO L93 Difference]: Finished difference Result 905 states and 1519 transitions. [2018-11-18 14:40:54,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:40:54,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-11-18 14:40:54,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:54,266 INFO L225 Difference]: With dead ends: 905 [2018-11-18 14:40:54,266 INFO L226 Difference]: Without dead ends: 382 [2018-11-18 14:40:54,268 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:40:54,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-18 14:40:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-18 14:40:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-18 14:40:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 613 transitions. [2018-11-18 14:40:54,283 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 613 transitions. Word has length 121 [2018-11-18 14:40:54,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:54,284 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 613 transitions. [2018-11-18 14:40:54,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:40:54,284 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 613 transitions. [2018-11-18 14:40:54,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-18 14:40:54,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:54,286 INFO L375 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] [2018-11-18 14:40:54,286 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:54,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:54,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1372472321, now seen corresponding path program 1 times [2018-11-18 14:40:54,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:40:54,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:54,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:54,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:54,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:40:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:40:54,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:40:54,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 14:40:54,361 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:40:54,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:40:54,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:40:54,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:40:54,362 INFO L87 Difference]: Start difference. First operand 382 states and 613 transitions. Second operand 6 states. [2018-11-18 14:40:55,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:55,078 INFO L93 Difference]: Finished difference Result 1241 states and 2101 transitions. [2018-11-18 14:40:55,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 14:40:55,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2018-11-18 14:40:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:55,085 INFO L225 Difference]: With dead ends: 1241 [2018-11-18 14:40:55,085 INFO L226 Difference]: Without dead ends: 865 [2018-11-18 14:40:55,087 INFO L604 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-11-18 14:40:55,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-11-18 14:40:55,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 818. [2018-11-18 14:40:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-11-18 14:40:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1267 transitions. [2018-11-18 14:40:55,120 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1267 transitions. Word has length 123 [2018-11-18 14:40:55,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:55,121 INFO L480 AbstractCegarLoop]: Abstraction has 818 states and 1267 transitions. [2018-11-18 14:40:55,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:40:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1267 transitions. [2018-11-18 14:40:55,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-18 14:40:55,123 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:55,123 INFO L375 BasicCegarLoop]: trace histogram [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-11-18 14:40:55,123 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:55,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:55,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1586168017, now seen corresponding path program 1 times [2018-11-18 14:40:55,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:40:55,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:55,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:55,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:55,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:40:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:40:55,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:40:55,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:40:55,201 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:40:55,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:40:55,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:40:55,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:40:55,202 INFO L87 Difference]: Start difference. First operand 818 states and 1267 transitions. Second operand 3 states. [2018-11-18 14:40:55,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:55,682 INFO L93 Difference]: Finished difference Result 2297 states and 3692 transitions. [2018-11-18 14:40:55,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:40:55,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-11-18 14:40:55,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:55,687 INFO L225 Difference]: With dead ends: 2297 [2018-11-18 14:40:55,687 INFO L226 Difference]: Without dead ends: 1485 [2018-11-18 14:40:55,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-18 14:40:55,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2018-11-18 14:40:55,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1478. [2018-11-18 14:40:55,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1478 states. [2018-11-18 14:40:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 2327 transitions. [2018-11-18 14:40:55,718 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 2327 transitions. Word has length 126 [2018-11-18 14:40:55,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:55,718 INFO L480 AbstractCegarLoop]: Abstraction has 1478 states and 2327 transitions. [2018-11-18 14:40:55,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:40:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2327 transitions. [2018-11-18 14:40:55,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-18 14:40:55,721 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:55,721 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:40:55,721 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:55,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:55,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1132847554, now seen corresponding path program 1 times [2018-11-18 14:40:55,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:40:55,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:55,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:55,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:55,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:40:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:40:55,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:40:55,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:40:55,841 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:40:55,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:40:55,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:40:55,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:40:55,842 INFO L87 Difference]: Start difference. First operand 1478 states and 2327 transitions. Second operand 5 states. [2018-11-18 14:40:56,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:56,281 INFO L93 Difference]: Finished difference Result 3050 states and 4851 transitions. [2018-11-18 14:40:56,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:40:56,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-11-18 14:40:56,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:56,287 INFO L225 Difference]: With dead ends: 3050 [2018-11-18 14:40:56,287 INFO L226 Difference]: Without dead ends: 1430 [2018-11-18 14:40:56,291 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:40:56,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2018-11-18 14:40:56,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1430. [2018-11-18 14:40:56,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1430 states. [2018-11-18 14:40:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2227 transitions. [2018-11-18 14:40:56,318 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2227 transitions. Word has length 137 [2018-11-18 14:40:56,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:56,318 INFO L480 AbstractCegarLoop]: Abstraction has 1430 states and 2227 transitions. [2018-11-18 14:40:56,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:40:56,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2227 transitions. [2018-11-18 14:40:56,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 14:40:56,322 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:56,322 INFO L375 BasicCegarLoop]: trace histogram [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, 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-11-18 14:40:56,322 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:56,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:56,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2082625773, now seen corresponding path program 1 times [2018-11-18 14:40:56,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:40:56,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:56,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:56,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:56,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:40:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:40:56,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:40:56,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:40:56,449 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-11-18 14:40:56,450 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-18 14:40:56,480 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:40:56,480 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:40:57,135 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 14:40:57,137 INFO L272 AbstractInterpreter]: Visited 116 different actions 340 times. Merged at 7 different actions 14 times. Never widened. Performed 3937 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3937 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-18 14:40:57,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:57,165 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 14:40:57,486 INFO L227 lantSequenceWeakener]: Weakened 160 states. On average, predicates are now at 84.27% of their original sizes. [2018-11-18 14:40:57,486 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 14:40:57,530 INFO L415 sIntCurrentIteration]: We unified 162 AI predicates to 162 [2018-11-18 14:40:57,530 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 14:40:57,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:40:57,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2018-11-18 14:40:57,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:40:57,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 14:40:57,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 14:40:57,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:40:57,532 INFO L87 Difference]: Start difference. First operand 1430 states and 2227 transitions. Second operand 10 states. [2018-11-18 14:41:01,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:41:01,739 INFO L93 Difference]: Finished difference Result 4071 states and 6461 transitions. [2018-11-18 14:41:01,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 14:41:01,739 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 163 [2018-11-18 14:41:01,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:41:01,746 INFO L225 Difference]: With dead ends: 4071 [2018-11-18 14:41:01,746 INFO L226 Difference]: Without dead ends: 2647 [2018-11-18 14:41:01,750 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 173 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2018-11-18 14:41:01,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2018-11-18 14:41:01,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2625. [2018-11-18 14:41:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2625 states. [2018-11-18 14:41:01,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2625 states and 3776 transitions. [2018-11-18 14:41:01,793 INFO L78 Accepts]: Start accepts. Automaton has 2625 states and 3776 transitions. Word has length 163 [2018-11-18 14:41:01,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:41:01,793 INFO L480 AbstractCegarLoop]: Abstraction has 2625 states and 3776 transitions. [2018-11-18 14:41:01,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 14:41:01,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 3776 transitions. [2018-11-18 14:41:01,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-18 14:41:01,798 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:41:01,798 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 14:41:01,798 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:41:01,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:41:01,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1378921477, now seen corresponding path program 1 times [2018-11-18 14:41:01,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:41:01,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:41:01,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:41:01,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:41:01,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:41:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:41:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 78 proven. 26 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 14:41:01,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:41:01,870 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:41:01,871 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2018-11-18 14:41:01,871 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [91], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-18 14:41:01,875 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:41:01,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:41:01,974 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 14:41:01,974 INFO L272 AbstractInterpreter]: Visited 117 different actions 228 times. Merged at 5 different actions 5 times. Never widened. Performed 2491 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2491 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-18 14:41:01,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:41:01,977 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 14:41:02,152 INFO L227 lantSequenceWeakener]: Weakened 183 states. On average, predicates are now at 80.87% of their original sizes. [2018-11-18 14:41:02,152 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 14:41:02,215 INFO L415 sIntCurrentIteration]: We unified 185 AI predicates to 185 [2018-11-18 14:41:02,215 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 14:41:02,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:41:02,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-18 14:41:02,216 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:41:02,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 14:41:02,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 14:41:02,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:41:02,216 INFO L87 Difference]: Start difference. First operand 2625 states and 3776 transitions. Second operand 10 states. [2018-11-18 14:41:05,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:41:05,578 INFO L93 Difference]: Finished difference Result 5543 states and 7944 transitions. [2018-11-18 14:41:05,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 14:41:05,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 186 [2018-11-18 14:41:05,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:41:05,588 INFO L225 Difference]: With dead ends: 5543 [2018-11-18 14:41:05,588 INFO L226 Difference]: Without dead ends: 2924 [2018-11-18 14:41:05,593 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 195 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-11-18 14:41:05,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2018-11-18 14:41:05,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2919. [2018-11-18 14:41:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2919 states. [2018-11-18 14:41:05,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 4107 transitions. [2018-11-18 14:41:05,653 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 4107 transitions. Word has length 186 [2018-11-18 14:41:05,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:41:05,653 INFO L480 AbstractCegarLoop]: Abstraction has 2919 states and 4107 transitions. [2018-11-18 14:41:05,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 14:41:05,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 4107 transitions. [2018-11-18 14:41:05,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-18 14:41:05,661 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:41:05,661 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 14:41:05,661 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:41:05,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:41:05,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1556294915, now seen corresponding path program 1 times [2018-11-18 14:41:05,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:41:05,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:41:05,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:41:05,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:41:05,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:41:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:41:05,730 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 86 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 14:41:05,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:41:05,730 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:41:05,730 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-11-18 14:41:05,731 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [91], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-18 14:41:05,734 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:41:05,734 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:41:06,060 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:41:06,060 INFO L272 AbstractInterpreter]: Visited 118 different actions 466 times. Merged at 8 different actions 30 times. Never widened. Performed 5593 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5593 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-18 14:41:06,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:41:06,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:41:06,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:41:06,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80653483-6bb4-431d-9f2a-e5b670863136/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-11-18 14:41:06,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:41:06,075 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:41:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:41:06,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:41:06,199 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 111 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 14:41:06,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:41:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 111 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 14:41:06,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:41:06,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-18 14:41:06,293 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:41:06,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 14:41:06,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 14:41:06,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-18 14:41:06,294 INFO L87 Difference]: Start difference. First operand 2919 states and 4107 transitions. Second operand 9 states. [2018-11-18 14:41:07,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:41:07,809 INFO L93 Difference]: Finished difference Result 8818 states and 13094 transitions. [2018-11-18 14:41:07,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 14:41:07,810 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 190 [2018-11-18 14:41:07,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:41:07,822 INFO L225 Difference]: With dead ends: 8818 [2018-11-18 14:41:07,822 INFO L226 Difference]: Without dead ends: 4068 [2018-11-18 14:41:07,835 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 385 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2018-11-18 14:41:07,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4068 states. [2018-11-18 14:41:07,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4068 to 3735. [2018-11-18 14:41:07,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3735 states. [2018-11-18 14:41:07,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3735 states to 3735 states and 4689 transitions. [2018-11-18 14:41:07,921 INFO L78 Accepts]: Start accepts. Automaton has 3735 states and 4689 transitions. Word has length 190 [2018-11-18 14:41:07,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:41:07,921 INFO L480 AbstractCegarLoop]: Abstraction has 3735 states and 4689 transitions. [2018-11-18 14:41:07,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 14:41:07,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3735 states and 4689 transitions. [2018-11-18 14:41:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-18 14:41:07,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:41:07,929 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-18 14:41:07,929 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:41:07,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:41:07,929 INFO L82 PathProgramCache]: Analyzing trace with hash 923006313, now seen corresponding path program 1 times [2018-11-18 14:41:07,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:41:07,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:41:07,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:41:07,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:41:07,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:41:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:41:08,005 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 112 proven. 23 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-18 14:41:08,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:41:08,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:41:08,005 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-11-18 14:41:08,006 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [99], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-18 14:41:08,009 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:41:08,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:41:08,391 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:41:08,392 INFO L272 AbstractInterpreter]: Visited 119 different actions 473 times. Merged at 9 different actions 33 times. Never widened. Performed 5387 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5387 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-18 14:41:08,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:41:08,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:41:08,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:41:08,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80653483-6bb4-431d-9f2a-e5b670863136/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-11-18 14:41:08,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:41:08,408 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:41:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:41:08,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:41:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 95 proven. 2 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-18 14:41:08,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:41:08,613 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 112 proven. 23 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-18 14:41:08,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:41:08,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-18 14:41:08,639 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:41:08,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 14:41:08,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 14:41:08,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-18 14:41:08,640 INFO L87 Difference]: Start difference. First operand 3735 states and 4689 transitions. Second operand 9 states. [2018-11-18 14:41:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:41:10,347 INFO L93 Difference]: Finished difference Result 11389 states and 14401 transitions. [2018-11-18 14:41:10,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-18 14:41:10,348 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 216 [2018-11-18 14:41:10,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:41:10,361 INFO L225 Difference]: With dead ends: 11389 [2018-11-18 14:41:10,361 INFO L226 Difference]: Without dead ends: 7660 [2018-11-18 14:41:10,367 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 452 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=289, Invalid=971, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 14:41:10,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7660 states. [2018-11-18 14:41:10,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7660 to 7367. [2018-11-18 14:41:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7367 states. [2018-11-18 14:41:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7367 states to 7367 states and 8617 transitions. [2018-11-18 14:41:10,461 INFO L78 Accepts]: Start accepts. Automaton has 7367 states and 8617 transitions. Word has length 216 [2018-11-18 14:41:10,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:41:10,462 INFO L480 AbstractCegarLoop]: Abstraction has 7367 states and 8617 transitions. [2018-11-18 14:41:10,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 14:41:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 7367 states and 8617 transitions. [2018-11-18 14:41:10,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-18 14:41:10,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:41:10,470 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 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, 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] [2018-11-18 14:41:10,470 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:41:10,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:41:10,470 INFO L82 PathProgramCache]: Analyzing trace with hash -858570813, now seen corresponding path program 1 times [2018-11-18 14:41:10,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:41:10,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:41:10,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:41:10,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:41:10,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:41:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:41:10,569 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 132 proven. 51 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 14:41:10,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:41:10,569 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:41:10,569 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 245 with the following transitions: [2018-11-18 14:41:10,569 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [13], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-18 14:41:10,572 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:41:10,572 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:41:10,872 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:41:10,872 INFO L272 AbstractInterpreter]: Visited 119 different actions 471 times. Merged at 8 different actions 31 times. Never widened. Performed 5497 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5497 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-18 14:41:10,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:41:10,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:41:10,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:41:10,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80653483-6bb4-431d-9f2a-e5b670863136/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-11-18 14:41:10,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:41:10,889 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:41:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:41:10,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:41:10,985 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 170 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-18 14:41:10,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:41:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 153 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-18 14:41:11,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:41:11,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-11-18 14:41:11,067 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:41:11,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 14:41:11,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 14:41:11,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:41:11,068 INFO L87 Difference]: Start difference. First operand 7367 states and 8617 transitions. Second operand 8 states. [2018-11-18 14:41:11,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:41:11,372 INFO L93 Difference]: Finished difference Result 12382 states and 14472 transitions. [2018-11-18 14:41:11,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:41:11,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 244 [2018-11-18 14:41:11,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:41:11,387 INFO L225 Difference]: With dead ends: 12382 [2018-11-18 14:41:11,387 INFO L226 Difference]: Without dead ends: 7171 [2018-11-18 14:41:11,394 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 486 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-18 14:41:11,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7171 states. [2018-11-18 14:41:11,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7171 to 7171. [2018-11-18 14:41:11,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7171 states. [2018-11-18 14:41:11,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7171 states to 7171 states and 8301 transitions. [2018-11-18 14:41:11,515 INFO L78 Accepts]: Start accepts. Automaton has 7171 states and 8301 transitions. Word has length 244 [2018-11-18 14:41:11,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:41:11,516 INFO L480 AbstractCegarLoop]: Abstraction has 7171 states and 8301 transitions. [2018-11-18 14:41:11,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 14:41:11,516 INFO L276 IsEmpty]: Start isEmpty. Operand 7171 states and 8301 transitions. [2018-11-18 14:41:11,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-18 14:41:11,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:41:11,528 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 14:41:11,529 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:41:11,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:41:11,529 INFO L82 PathProgramCache]: Analyzing trace with hash -159557575, now seen corresponding path program 1 times [2018-11-18 14:41:11,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:41:11,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:41:11,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:41:11,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:41:11,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:41:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:41:11,685 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 163 proven. 95 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 14:41:11,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:41:11,685 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:41:11,685 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-11-18 14:41:11,685 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [67], [68], [72], [76], [80], [84], [88], [92], [96], [99], [100], [104], [108], [112], [115], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-18 14:41:11,688 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:41:11,688 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:41:11,859 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:41:11,859 INFO L272 AbstractInterpreter]: Visited 120 different actions 362 times. Merged at 9 different actions 26 times. Never widened. Performed 4204 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4204 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-18 14:41:11,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:41:11,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:41:11,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:41:11,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80653483-6bb4-431d-9f2a-e5b670863136/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-11-18 14:41:11,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:41:11,871 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:41:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:41:11,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:41:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 217 proven. 2 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-18 14:41:11,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:41:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 175 proven. 54 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-18 14:41:12,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:41:12,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2018-11-18 14:41:12,040 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:41:12,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 14:41:12,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 14:41:12,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-18 14:41:12,040 INFO L87 Difference]: Start difference. First operand 7171 states and 8301 transitions. Second operand 11 states. [2018-11-18 14:41:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:41:12,617 INFO L93 Difference]: Finished difference Result 10295 states and 12037 transitions. [2018-11-18 14:41:12,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 14:41:12,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 246 [2018-11-18 14:41:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:41:12,622 INFO L225 Difference]: With dead ends: 10295 [2018-11-18 14:41:12,623 INFO L226 Difference]: Without dead ends: 4310 [2018-11-18 14:41:12,628 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 494 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-11-18 14:41:12,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4310 states. [2018-11-18 14:41:12,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4310 to 4232. [2018-11-18 14:41:12,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4232 states. [2018-11-18 14:41:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4232 states to 4232 states and 4803 transitions. [2018-11-18 14:41:12,667 INFO L78 Accepts]: Start accepts. Automaton has 4232 states and 4803 transitions. Word has length 246 [2018-11-18 14:41:12,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:41:12,668 INFO L480 AbstractCegarLoop]: Abstraction has 4232 states and 4803 transitions. [2018-11-18 14:41:12,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 14:41:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 4232 states and 4803 transitions. [2018-11-18 14:41:12,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-11-18 14:41:12,673 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:41:12,674 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-18 14:41:12,674 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:41:12,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:41:12,674 INFO L82 PathProgramCache]: Analyzing trace with hash 373071930, now seen corresponding path program 1 times [2018-11-18 14:41:12,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:41:12,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:41:12,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:41:12,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:41:12,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:41:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:41:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 189 proven. 60 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-18 14:41:12,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:41:12,879 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:41:12,879 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 269 with the following transitions: [2018-11-18 14:41:12,880 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [123], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-18 14:41:12,882 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:41:12,882 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:41:13,118 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:41:13,119 INFO L272 AbstractInterpreter]: Visited 119 different actions 485 times. Merged at 9 different actions 45 times. Widened at 1 different actions 1 times. Performed 5648 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5648 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 11 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-18 14:41:13,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:41:13,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:41:13,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:41:13,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80653483-6bb4-431d-9f2a-e5b670863136/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:41:13,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:41:13,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:41:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:41:13,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:41:13,250 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 245 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-18 14:41:13,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:41:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 204 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-18 14:41:13,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:41:13,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-18 14:41:13,344 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:41:13,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 14:41:13,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 14:41:13,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-18 14:41:13,345 INFO L87 Difference]: Start difference. First operand 4232 states and 4803 transitions. Second operand 11 states. [2018-11-18 14:41:14,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:41:14,324 INFO L93 Difference]: Finished difference Result 10404 states and 11935 transitions. [2018-11-18 14:41:14,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 14:41:14,325 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 268 [2018-11-18 14:41:14,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:41:14,331 INFO L225 Difference]: With dead ends: 10404 [2018-11-18 14:41:14,331 INFO L226 Difference]: Without dead ends: 4653 [2018-11-18 14:41:14,339 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 543 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2018-11-18 14:41:14,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4653 states. [2018-11-18 14:41:14,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4653 to 3946. [2018-11-18 14:41:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2018-11-18 14:41:14,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 4183 transitions. [2018-11-18 14:41:14,379 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 4183 transitions. Word has length 268 [2018-11-18 14:41:14,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:41:14,380 INFO L480 AbstractCegarLoop]: Abstraction has 3946 states and 4183 transitions. [2018-11-18 14:41:14,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 14:41:14,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 4183 transitions. [2018-11-18 14:41:14,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-11-18 14:41:14,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:41:14,385 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-11-18 14:41:14,386 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:41:14,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:41:14,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1915824983, now seen corresponding path program 1 times [2018-11-18 14:41:14,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:41:14,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:41:14,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:41:14,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:41:14,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:41:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:41:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 288 proven. 2 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-18 14:41:14,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:41:14,487 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:41:14,487 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 300 with the following transitions: [2018-11-18 14:41:14,487 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-18 14:41:14,489 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:41:14,489 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:41:14,680 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:41:14,680 INFO L272 AbstractInterpreter]: Visited 120 different actions 466 times. Merged at 8 different actions 26 times. Never widened. Performed 5509 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5509 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-18 14:41:14,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:41:14,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:41:14,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:41:14,682 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80653483-6bb4-431d-9f2a-e5b670863136/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:41:14,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:41:14,688 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:41:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:41:14,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:41:14,859 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 340 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-18 14:41:14,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:41:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 274 proven. 36 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-18 14:41:15,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:41:15,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-11-18 14:41:15,073 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:41:15,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 14:41:15,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 14:41:15,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-18 14:41:15,074 INFO L87 Difference]: Start difference. First operand 3946 states and 4183 transitions. Second operand 10 states. [2018-11-18 14:41:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:41:15,935 INFO L93 Difference]: Finished difference Result 4791 states and 5090 transitions. [2018-11-18 14:41:15,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 14:41:15,935 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 299 [2018-11-18 14:41:15,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:41:15,935 INFO L225 Difference]: With dead ends: 4791 [2018-11-18 14:41:15,935 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 14:41:15,940 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 601 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2018-11-18 14:41:15,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 14:41:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 14:41:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 14:41:15,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 14:41:15,941 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 299 [2018-11-18 14:41:15,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:41:15,941 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:41:15,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 14:41:15,941 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 14:41:15,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 14:41:15,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 14:41:16,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:41:16,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:41:16,226 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 144 [2018-11-18 14:41:16,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:41:16,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:41:16,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:41:16,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:41:16,360 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 153 [2018-11-18 14:41:17,491 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 194 DAG size of output: 105 [2018-11-18 14:41:18,012 WARN L180 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 85 [2018-11-18 14:41:18,555 WARN L180 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 74 [2018-11-18 14:41:18,557 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 14:41:18,557 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a28~0 |old(~a28~0)|) (= ~a11~0 |old(~a11~0)|) (= |old(~a17~0)| ~a17~0) (= ~a19~0 |old(~a19~0)|) (<= |old(~a28~0)| ~a28~0) (= ~a25~0 |old(~a25~0)|)) [2018-11-18 14:41:18,557 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 14:41:18,557 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,557 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,558 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,558 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,558 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,558 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-18 14:41:18,558 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-18 14:41:18,558 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-18 14:41:18,558 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-18 14:41:18,558 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-18 14:41:18,558 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-18 14:41:18,558 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-18 14:41:18,559 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-18 14:41:18,559 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-18 14:41:18,559 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-18 14:41:18,559 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-18 14:41:18,559 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-18 14:41:18,559 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-18 14:41:18,559 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,559 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,559 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,559 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,559 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-18 14:41:18,559 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,559 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-18 14:41:18,559 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-18 14:41:18,560 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-18 14:41:18,560 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-18 14:41:18,560 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-18 14:41:18,560 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-18 14:41:18,560 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-18 14:41:18,560 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-18 14:41:18,560 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-18 14:41:18,560 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-18 14:41:18,560 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-18 14:41:18,560 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-18 14:41:18,560 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-18 14:41:18,560 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-18 14:41:18,560 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-18 14:41:18,560 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,560 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,560 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,561 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,561 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,561 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-18 14:41:18,561 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-18 14:41:18,561 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-18 14:41:18,561 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-18 14:41:18,561 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-18 14:41:18,561 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-18 14:41:18,561 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-18 14:41:18,561 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-18 14:41:18,561 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-18 14:41:18,561 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-18 14:41:18,561 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-18 14:41:18,561 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,561 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,561 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,561 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,562 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,562 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-18 14:41:18,562 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-18 14:41:18,562 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-18 14:41:18,562 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-18 14:41:18,562 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-18 14:41:18,562 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-18 14:41:18,562 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-18 14:41:18,562 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-18 14:41:18,562 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-18 14:41:18,562 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 487) no Hoare annotation was computed. [2018-11-18 14:41:18,562 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-18 14:41:18,562 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-18 14:41:18,562 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-18 14:41:18,562 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-18 14:41:18,562 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,563 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,563 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,563 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,563 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,563 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-18 14:41:18,563 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-18 14:41:18,563 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-18 14:41:18,563 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-18 14:41:18,563 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-18 14:41:18,563 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-18 14:41:18,563 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-18 14:41:18,563 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-18 14:41:18,563 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-18 14:41:18,563 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-18 14:41:18,563 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-18 14:41:18,563 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-18 14:41:18,564 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-18 14:41:18,564 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-18 14:41:18,564 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-18 14:41:18,564 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-18 14:41:18,564 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,564 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,564 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,564 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,564 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-18 14:41:18,564 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,564 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-18 14:41:18,564 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,572 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-18 14:41:18,572 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-18 14:41:18,572 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-18 14:41:18,572 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,572 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,572 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-18 14:41:18,572 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-18 14:41:18,572 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-18 14:41:18,572 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-18 14:41:18,572 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-18 14:41:18,572 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-18 14:41:18,572 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-18 14:41:18,573 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-18 14:41:18,573 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-18 14:41:18,573 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-18 14:41:18,573 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-18 14:41:18,573 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,573 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,573 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,573 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,573 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,573 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,573 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-18 14:41:18,573 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-18 14:41:18,573 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-18 14:41:18,573 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-18 14:41:18,573 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-18 14:41:18,573 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-18 14:41:18,573 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-18 14:41:18,574 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-18 14:41:18,574 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-18 14:41:18,574 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-18 14:41:18,574 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-18 14:41:18,574 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,574 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,574 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,574 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,574 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,574 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,574 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-18 14:41:18,574 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-18 14:41:18,574 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-18 14:41:18,574 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-18 14:41:18,574 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-18 14:41:18,574 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-18 14:41:18,574 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-18 14:41:18,575 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-18 14:41:18,575 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-18 14:41:18,575 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-18 14:41:18,575 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-18 14:41:18,575 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-18 14:41:18,575 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-18 14:41:18,575 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-18 14:41:18,575 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,575 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,575 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,575 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse26 (= 1 |old(~a25~0)|))) (let ((.cse21 (= ~a11~0 0)) (.cse23 (<= ~a28~0 |old(~a28~0)|)) (.cse22 (= ~a17~0 8)) (.cse24 (<= |old(~a28~0)| ~a28~0)) (.cse32 (not (= ~a28~0 10))) (.cse29 (<= ~a17~0 |old(~a17~0)|)) (.cse31 (not (= ~a25~0 1))) (.cse30 (= ~a11~0 |old(~a11~0)|)) (.cse5 (= |old(~a17~0)| ~a17~0)) (.cse20 (= |old(~a28~0)| ~a28~0)) (.cse8 (= ~a19~0 |old(~a19~0)|)) (.cse9 (= ~a25~0 |old(~a25~0)|)) (.cse14 (= 9 |old(~a28~0)|)) (.cse35 (not .cse26)) (.cse0 (not (= 1 ~a21~0))) (.cse2 (not (= 1 |old(~a19~0)|))) (.cse34 (not (= 0 |old(~a11~0)|)))) (let ((.cse17 (and (or .cse0 .cse35 .cse34) (or .cse0 (not (= 7 |old(~a28~0)|)) .cse2 .cse34 (not (= 0 |old(~a25~0)|))))) (.cse7 (= 9 ~a28~0)) (.cse4 (not .cse14)) (.cse12 (and .cse30 .cse5 .cse20 .cse8 .cse9)) (.cse36 (and .cse29 .cse30 .cse31 .cse8)) (.cse27 (< 7 |old(~a17~0)|)) (.cse28 (and .cse29 .cse30 .cse8 .cse32)) (.cse1 (< |old(~a17~0)| 8)) (.cse13 (< |old(~a28~0)| 9)) (.cse15 (= |old(~a11~0)| |old(~a19~0)|)) (.cse3 (< 8 |old(~a17~0)|)) (.cse33 (and .cse21 .cse23 .cse22 .cse8 .cse24 .cse9)) (.cse16 (= |calculate_output_#in~input| 0)) (.cse11 (< 10 |old(~a28~0)|)) (.cse18 (= 0 |old(~a28~0)|)) (.cse25 (= 10 |old(~a28~0)|)) (.cse6 (= 1 ~a11~0)) (.cse19 (not (= 8 |old(~a17~0)|))) (.cse10 (not (= 1 |old(~a11~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (or .cse11 .cse0 .cse1 .cse12 .cse2 .cse13 .cse14 .cse15 .cse3) (or (or .cse16 .cse17 .cse2 .cse18 .cse19) (and .cse20 .cse21 .cse22 .cse8 .cse9)) (or .cse11 .cse0 .cse1 (and .cse5 .cse23 .cse6 .cse8 .cse24 .cse9) .cse25 .cse14 .cse15 .cse3 .cse10 .cse26) (or .cse0 .cse25 .cse15 .cse27 .cse28) (or .cse0 (and .cse29 .cse30 .cse31 .cse8 .cse32) .cse25 .cse27 .cse26) (or .cse14 .cse16 .cse33 .cse17 .cse11 .cse13 .cse19) (or .cse0 .cse34 .cse16 .cse2 (and .cse21 .cse7 .cse22 .cse8 .cse9) .cse19 .cse4) (or .cse0 .cse12 .cse1 .cse35 .cse2 .cse3 (not (= |old(~a28~0)| 7))) (or .cse0 .cse36 .cse15 .cse27 .cse26) (or .cse0 .cse36 .cse2 .cse27 .cse26) (or .cse0 .cse2 .cse25 .cse27 .cse28) (or (or .cse0 .cse1 .cse35 .cse2 .cse13 .cse14 .cse15 .cse3) (and .cse30 .cse5 .cse23 .cse8 .cse24 .cse9)) (or .cse0 .cse33 .cse34 .cse14 .cse16 .cse26 .cse11 .cse18 .cse25 .cse19) (or .cse0 (not .cse25) .cse35 .cse2 (and .cse6 (= 1 ~a25~0) (= 8 ~a17~0) (= 1 ~a19~0) (= 10 ~a28~0)) .cse19 .cse10))))) [2018-11-18 14:41:18,576 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,576 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,576 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,576 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-18 14:41:18,576 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-18 14:41:18,576 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-18 14:41:18,576 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-18 14:41:18,576 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-18 14:41:18,576 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-18 14:41:18,576 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-18 14:41:18,576 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-18 14:41:18,576 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-18 14:41:18,576 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-18 14:41:18,576 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-18 14:41:18,576 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-18 14:41:18,576 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-18 14:41:18,576 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,577 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,577 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,577 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,577 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,577 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,577 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-18 14:41:18,577 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-18 14:41:18,577 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-18 14:41:18,577 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-18 14:41:18,577 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-18 14:41:18,577 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-18 14:41:18,577 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-18 14:41:18,577 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-18 14:41:18,577 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-18 14:41:18,577 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-18 14:41:18,577 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-18 14:41:18,577 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-18 14:41:18,578 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-18 14:41:18,578 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-18 14:41:18,578 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-18 14:41:18,578 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-11-18 14:41:18,578 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,578 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,578 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,578 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,578 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 14:41:18,578 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-18 14:41:18,578 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-18 14:41:18,578 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-18 14:41:18,578 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-18 14:41:18,578 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-18 14:41:18,578 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-18 14:41:18,578 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-18 14:41:18,578 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-18 14:41:18,579 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-18 14:41:18,579 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-18 14:41:18,579 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-18 14:41:18,579 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-18 14:41:18,579 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-18 14:41:18,579 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-18 14:41:18,579 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-18 14:41:18,579 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-18 14:41:18,579 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-18 14:41:18,579 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-18 14:41:18,579 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-18 14:41:18,579 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 14:41:18,579 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-11-18 14:41:18,579 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 14:41:18,579 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 14:41:18,580 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and (= ~a11~0 0) (= ~a17~0 8) (= ~a28~0 7) (= ~a19~0 |old(~a19~0)|) (= ~a25~0 |old(~a25~0)|)) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-11-18 14:41:18,580 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-18 14:41:18,580 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse14 (= ~a11~0 0)) (.cse16 (not (= ~a28~0 0))) (.cse17 (= ~a25~0 1))) (let ((.cse9 (= 1 ~a11~0)) (.cse11 (= 9 ~a28~0)) (.cse13 (not (= main_~input~0 0))) (.cse1 (and .cse14 .cse16 (= ~a17~0 8) (= ~a21~0 1) .cse17)) (.cse7 (<= 9 ~a28~0)) (.cse2 (<= ~a17~0 7)) (.cse5 (not (= ~a19~0 ~a11~0))) (.cse4 (not .cse17)) (.cse6 (<= ~a28~0 10)) (.cse3 (not (= ~a28~0 10))) (.cse10 (<= ~a17~0 8)) (.cse8 (not (= ~a28~0 9))) (.cse15 (= 1 ~a25~0)) (.cse12 (= 8 ~a17~0)) (.cse0 (= 1 ~a19~0))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and .cse0 .cse1) (and .cse2 .cse0 .cse3) (not (= 0 |old(~a11~0)|)) (and .cse2 .cse4 .cse3) (and .cse2 .cse4 .cse0) (and (and .cse0 .cse5) (= |old(~a17~0)| ~a17~0) .cse6 .cse7 .cse8) (and .cse4 .cse6 .cse3 .cse9 .cse10 .cse5 .cse8) (and .cse9 .cse11 .cse12 .cse0) (and .cse13 .cse14 .cse11 .cse0 .cse10) (and .cse13 .cse6 .cse1 .cse7 .cse8) (not (= 0 |old(~a25~0)|)) (and .cse2 .cse4 .cse5) (and .cse2 .cse5 .cse3) (and .cse15 (= |old(~a28~0)| ~a28~0) .cse0 .cse10) (and .cse4 .cse6 .cse3 .cse14 .cse16 .cse10 .cse8) (not (= 1 |old(~a19~0)|)) (and .cse15 .cse12 .cse0 (= 10 ~a28~0)) (not (= 8 |old(~a17~0)|))))) [2018-11-18 14:41:18,580 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-18 14:41:18,580 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-18 14:41:18,580 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse5 (not (= ~a28~0 0))) (.cse17 (= ~a25~0 1)) (.cse4 (= ~a11~0 0))) (let ((.cse13 (= 1 ~a11~0)) (.cse14 (= 9 ~a28~0)) (.cse2 (<= ~a28~0 10)) (.cse12 (<= 9 ~a28~0)) (.cse7 (not (= ~a28~0 9))) (.cse0 (not (= main_~input~0 0))) (.cse16 (let ((.cse18 (= ~a17~0 8)) (.cse19 (= ~a21~0 1))) (or (and .cse4 .cse5 .cse18 .cse19 .cse17) (and .cse4 (= ~a25~0 0) .cse18 (= ~a19~0 1) (= ~a28~0 7) .cse19)))) (.cse1 (not .cse17)) (.cse10 (<= ~a17~0 7)) (.cse11 (not (= ~a19~0 ~a11~0))) (.cse3 (not (= ~a28~0 10))) (.cse6 (<= ~a17~0 8)) (.cse8 (= 1 ~a25~0)) (.cse15 (= 8 ~a17~0)) (.cse9 (= 1 ~a19~0))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= 7 |old(~a28~0)|)) (and (= ~a11~0 |old(~a11~0)|) (and .cse8 (<= 11 ~a28~0) .cse9 .cse6)) (and .cse10 .cse9 .cse3) (not (= 0 |old(~a11~0)|)) (and .cse10 .cse1 .cse3) (and .cse10 .cse1 .cse9) (and (and .cse9 .cse11) (= |old(~a17~0)| ~a17~0) .cse2 .cse12 .cse7) (and .cse1 .cse2 .cse3 .cse13 .cse6 .cse11 .cse7) (and .cse13 .cse14 .cse15 .cse9) (and .cse0 .cse4 .cse14 .cse9 .cse6) (and .cse0 .cse2 .cse16 .cse12 .cse7) (and .cse0 (= ~a19~0 |old(~a19~0)|) .cse16) (not (= 0 |old(~a25~0)|)) (and .cse10 .cse1 .cse11) (and .cse10 .cse11 .cse3) (and .cse8 (= |old(~a28~0)| ~a28~0) .cse9 .cse6) (not (= 1 |old(~a19~0)|)) (and .cse8 .cse15 .cse9 (= 10 ~a28~0)) (not (= 8 |old(~a17~0)|))))) [2018-11-18 14:41:18,580 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-18 14:41:18,580 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-18 14:41:18,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:41:18 BoogieIcfgContainer [2018-11-18 14:41:18,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 14:41:18,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:41:18,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:41:18,591 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:41:18,592 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:40:52" (3/4) ... [2018-11-18 14:41:18,594 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 14:41:18,599 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 14:41:18,599 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-18 14:41:18,600 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 14:41:18,609 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-18 14:41:18,610 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 14:41:18,630 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(1 == a21) || !(7 == \old(a28))) || (1 == a19 && (((a11 == 0 && !(a28 == 0)) && a17 == 8) && a21 == 1) && a25 == 1)) || ((a17 <= 7 && 1 == a19) && !(a28 == 10))) || !(0 == \old(a11))) || ((a17 <= 7 && !(a25 == 1)) && !(a28 == 10))) || ((a17 <= 7 && !(a25 == 1)) && 1 == a19)) || (((((1 == a19 && !(a19 == a11)) && \old(a17) == a17) && a28 <= 10) && 9 <= a28) && !(a28 == 9))) || ((((((!(a25 == 1) && a28 <= 10) && !(a28 == 10)) && 1 == a11) && a17 <= 8) && !(a19 == a11)) && !(a28 == 9))) || (((1 == a11 && 9 == a28) && 8 == a17) && 1 == a19)) || ((((!(input == 0) && a11 == 0) && 9 == a28) && 1 == a19) && a17 <= 8)) || ((((!(input == 0) && a28 <= 10) && (((a11 == 0 && !(a28 == 0)) && a17 == 8) && a21 == 1) && a25 == 1) && 9 <= a28) && !(a28 == 9))) || !(0 == \old(a25))) || ((a17 <= 7 && !(a25 == 1)) && !(a19 == a11))) || ((a17 <= 7 && !(a19 == a11)) && !(a28 == 10))) || (((1 == a25 && \old(a28) == a28) && 1 == a19) && a17 <= 8)) || ((((((!(a25 == 1) && a28 <= 10) && !(a28 == 10)) && a11 == 0) && !(a28 == 0)) && a17 <= 8) && !(a28 == 9))) || !(1 == \old(a19))) || (((1 == a25 && 8 == a17) && 1 == a19) && 10 == a28)) || !(8 == \old(a17)) [2018-11-18 14:41:18,688 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_80653483-6bb4-431d-9f2a-e5b670863136/bin-2019/utaipan/witness.graphml [2018-11-18 14:41:18,688 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:41:18,688 INFO L168 Benchmark]: Toolchain (without parser) took 27477.74 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 956.6 MB in the beginning and 938.5 MB in the end (delta: 18.1 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-11-18 14:41:18,689 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:41:18,689 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.66 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 924.3 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-18 14:41:18,689 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 924.3 MB in the beginning and 1.2 GB in the end (delta: -239.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-18 14:41:18,689 INFO L168 Benchmark]: Boogie Preprocessor took 49.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 14:41:18,690 INFO L168 Benchmark]: RCFGBuilder took 773.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 102.6 MB). Peak memory consumption was 102.6 MB. Max. memory is 11.5 GB. [2018-11-18 14:41:18,690 INFO L168 Benchmark]: TraceAbstraction took 26144.55 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 966.4 MB in the end (delta: 91.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-11-18 14:41:18,690 INFO L168 Benchmark]: Witness Printer took 96.77 ms. Allocated memory is still 2.4 GB. Free memory was 966.4 MB in the beginning and 938.5 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2018-11-18 14:41:18,691 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.66 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 924.3 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 924.3 MB in the beginning and 1.2 GB in the end (delta: -239.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 773.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 102.6 MB). Peak memory consumption was 102.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26144.55 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 966.4 MB in the end (delta: 91.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 96.77 ms. Allocated memory is still 2.4 GB. Free memory was 966.4 MB in the beginning and 938.5 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 487]: 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: 606]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(1 == a21) || !(7 == \old(a28))) || (1 == a19 && (((a11 == 0 && !(a28 == 0)) && a17 == 8) && a21 == 1) && a25 == 1)) || ((a17 <= 7 && 1 == a19) && !(a28 == 10))) || !(0 == \old(a11))) || ((a17 <= 7 && !(a25 == 1)) && !(a28 == 10))) || ((a17 <= 7 && !(a25 == 1)) && 1 == a19)) || (((((1 == a19 && !(a19 == a11)) && \old(a17) == a17) && a28 <= 10) && 9 <= a28) && !(a28 == 9))) || ((((((!(a25 == 1) && a28 <= 10) && !(a28 == 10)) && 1 == a11) && a17 <= 8) && !(a19 == a11)) && !(a28 == 9))) || (((1 == a11 && 9 == a28) && 8 == a17) && 1 == a19)) || ((((!(input == 0) && a11 == 0) && 9 == a28) && 1 == a19) && a17 <= 8)) || ((((!(input == 0) && a28 <= 10) && (((a11 == 0 && !(a28 == 0)) && a17 == 8) && a21 == 1) && a25 == 1) && 9 <= a28) && !(a28 == 9))) || !(0 == \old(a25))) || ((a17 <= 7 && !(a25 == 1)) && !(a19 == a11))) || ((a17 <= 7 && !(a19 == a11)) && !(a28 == 10))) || (((1 == a25 && \old(a28) == a28) && 1 == a19) && a17 <= 8)) || ((((((!(a25 == 1) && a28 <= 10) && !(a28 == 10)) && a11 == 0) && !(a28 == 0)) && a17 <= 8) && !(a28 == 9))) || !(1 == \old(a19))) || (((1 == a25 && 8 == a17) && 1 == a19) && 10 == a28)) || !(8 == \old(a17)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 26.0s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 16.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1514 SDtfs, 13290 SDslu, 2633 SDs, 0 SdLazy, 19199 SolverSat, 2753 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 3507 GetRequests, 3307 SyntacticMatches, 20 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7367occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.4s AbstIntTime, 8 AbstIntIterations, 2 AbstIntStrong, 0.9968793467042901 AbsIntWeakeningRatio, 0.207492795389049 AbsIntAvgWeakeningVarsNumRemoved, 25.446685878962537 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 1497 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 242 PreInvPairs, 324 NumberOfFragments, 1333 HoareAnnotationTreeSize, 242 FomulaSimplifications, 8304 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 11592 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 3894 NumberOfCodeBlocks, 3894 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5332 ConstructedInterpolants, 0 QuantifiedInterpolants, 2377913 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3586 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 25 InterpolantComputations, 5 PerfectInterpolantSequences, 4560/5027 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...