./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label39_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_5318e4a3-8242-4c33-994e-2eecc35ef73c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5318e4a3-8242-4c33-994e-2eecc35ef73c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5318e4a3-8242-4c33-994e-2eecc35ef73c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5318e4a3-8242-4c33-994e-2eecc35ef73c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5318e4a3-8242-4c33-994e-2eecc35ef73c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5318e4a3-8242-4c33-994e-2eecc35ef73c/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 1e89048ccdb20a97a14cb213e125edb5cbe6d123 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 17:26:59,640 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:26:59,641 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:26:59,649 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:26:59,649 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:26:59,650 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:26:59,650 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:26:59,651 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:26:59,652 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:26:59,653 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:26:59,654 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:26:59,654 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:26:59,654 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:26:59,655 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:26:59,656 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:26:59,656 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:26:59,657 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:26:59,658 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:26:59,660 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:26:59,660 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:26:59,661 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:26:59,662 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:26:59,663 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:26:59,663 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:26:59,663 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:26:59,664 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:26:59,664 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:26:59,665 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:26:59,666 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:26:59,666 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:26:59,666 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:26:59,667 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:26:59,667 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:26:59,667 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:26:59,668 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:26:59,668 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:26:59,669 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5318e4a3-8242-4c33-994e-2eecc35ef73c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 17:26:59,676 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:26:59,677 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:26:59,677 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:26:59,678 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 17:26:59,678 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 17:26:59,678 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 17:26:59,678 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 17:26:59,678 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 17:26:59,678 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 17:26:59,678 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 17:26:59,678 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 17:26:59,679 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 17:26:59,679 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 17:26:59,679 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:26:59,679 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:26:59,680 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:26:59,680 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:26:59,680 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:26:59,680 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:26:59,680 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:26:59,680 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:26:59,680 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:26:59,680 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:26:59,681 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:26:59,681 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:26:59,681 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:26:59,681 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:26:59,681 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:26:59,681 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:26:59,681 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:26:59,681 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:26:59,682 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:26:59,682 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:26:59,682 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 17:26:59,682 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:26:59,682 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 17:26:59,682 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 17:26:59,682 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_5318e4a3-8242-4c33-994e-2eecc35ef73c/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 -> 1e89048ccdb20a97a14cb213e125edb5cbe6d123 [2018-11-18 17:26:59,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:26:59,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:26:59,718 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:26:59,719 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:26:59,720 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:26:59,720 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5318e4a3-8242-4c33-994e-2eecc35ef73c/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c [2018-11-18 17:26:59,767 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5318e4a3-8242-4c33-994e-2eecc35ef73c/bin-2019/utaipan/data/5fcfe227c/0402548c96d34658b2a3e62fa508b3f5/FLAGfde9bc946 [2018-11-18 17:27:00,149 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:27:00,150 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5318e4a3-8242-4c33-994e-2eecc35ef73c/sv-benchmarks/c/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c [2018-11-18 17:27:00,159 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5318e4a3-8242-4c33-994e-2eecc35ef73c/bin-2019/utaipan/data/5fcfe227c/0402548c96d34658b2a3e62fa508b3f5/FLAGfde9bc946 [2018-11-18 17:27:00,524 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5318e4a3-8242-4c33-994e-2eecc35ef73c/bin-2019/utaipan/data/5fcfe227c/0402548c96d34658b2a3e62fa508b3f5 [2018-11-18 17:27:00,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:27:00,527 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:27:00,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:27:00,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:27:00,530 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:27:00,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:27:00" (1/1) ... [2018-11-18 17:27:00,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d293ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:00, skipping insertion in model container [2018-11-18 17:27:00,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:27:00" (1/1) ... [2018-11-18 17:27:00,541 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:27:00,574 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:27:00,782 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:27:00,786 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:27:00,845 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:27:00,857 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:27:00,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:00 WrapperNode [2018-11-18 17:27:00,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:27:00,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:27:00,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:27:00,859 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:27:00,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:00" (1/1) ... [2018-11-18 17:27:00,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:00" (1/1) ... [2018-11-18 17:27:00,929 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:27:00,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:27:00,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:27:00,930 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:27:00,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:00" (1/1) ... [2018-11-18 17:27:00,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:00" (1/1) ... [2018-11-18 17:27:00,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:00" (1/1) ... [2018-11-18 17:27:00,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:00" (1/1) ... [2018-11-18 17:27:00,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:00" (1/1) ... [2018-11-18 17:27:00,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:00" (1/1) ... [2018-11-18 17:27:00,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:00" (1/1) ... [2018-11-18 17:27:00,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:27:00,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:27:00,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:27:00,989 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:27:00,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5318e4a3-8242-4c33-994e-2eecc35ef73c/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 17:27:01,054 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 17:27:01,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:27:01,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:27:01,055 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-18 17:27:01,055 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-18 17:27:01,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:27:01,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:27:01,055 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:27:01,055 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:27:01,851 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:27:01,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:27:01 BoogieIcfgContainer [2018-11-18 17:27:01,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:27:01,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:27:01,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:27:01,855 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:27:01,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:27:00" (1/3) ... [2018-11-18 17:27:01,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da0ee33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:27:01, skipping insertion in model container [2018-11-18 17:27:01,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:27:00" (2/3) ... [2018-11-18 17:27:01,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da0ee33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:27:01, skipping insertion in model container [2018-11-18 17:27:01,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:27:01" (3/3) ... [2018-11-18 17:27:01,858 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label39_true-unreach-call_false-termination.c [2018-11-18 17:27:01,864 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:27:01,870 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 17:27:01,880 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 17:27:01,903 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:27:01,903 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:27:01,903 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:27:01,903 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:27:01,903 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:27:01,903 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:27:01,904 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:27:01,904 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:27:01,921 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-18 17:27:01,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 17:27:01,929 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:27:01,930 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, 1, 1, 1, 1, 1, 1] [2018-11-18 17:27:01,932 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:27:01,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:27:01,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1592268880, now seen corresponding path program 1 times [2018-11-18 17:27:01,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:27:01,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:01,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:27:01,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:01,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:27:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:27:02,236 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 17:27:02,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:27:02,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:27:02,238 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:27:02,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:27:02,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:27:02,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:27:02,253 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-18 17:27:02,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:27:02,835 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-11-18 17:27:02,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:27:02,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2018-11-18 17:27:02,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:27:02,846 INFO L225 Difference]: With dead ends: 621 [2018-11-18 17:27:02,846 INFO L226 Difference]: Without dead ends: 382 [2018-11-18 17:27:02,849 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 17:27:02,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-18 17:27:02,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-18 17:27:02,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-18 17:27:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-11-18 17:27:02,894 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 118 [2018-11-18 17:27:02,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:27:02,895 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-11-18 17:27:02,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:27:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-11-18 17:27:02,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 17:27:02,898 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:27:02,899 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, 1, 1, 1, 1, 1, 1] [2018-11-18 17:27:02,899 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:27:02,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:27:02,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1462652163, now seen corresponding path program 1 times [2018-11-18 17:27:02,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:27:02,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:02,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:27:02,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:02,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:27:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:27:03,101 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 17:27:03,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:27:03,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:27:03,102 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:27:03,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:27:03,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:27:03,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:27:03,104 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-11-18 17:27:03,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:27:03,621 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-11-18 17:27:03,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 17:27:03,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-11-18 17:27:03,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:27:03,625 INFO L225 Difference]: With dead ends: 903 [2018-11-18 17:27:03,625 INFO L226 Difference]: Without dead ends: 381 [2018-11-18 17:27:03,627 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 17:27:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-18 17:27:03,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-18 17:27:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-18 17:27:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-11-18 17:27:03,643 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 127 [2018-11-18 17:27:03,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:27:03,643 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-11-18 17:27:03,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:27:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-11-18 17:27:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-18 17:27:03,645 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:27:03,646 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:27:03,646 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:27:03,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:27:03,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1825296655, now seen corresponding path program 1 times [2018-11-18 17:27:03,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:27:03,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:03,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:27:03,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:03,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:27:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:27:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:27:03,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:27:03,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:27:03,823 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:27:03,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:27:03,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:27:03,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:27:03,823 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-11-18 17:27:04,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:27:04,292 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-11-18 17:27:04,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 17:27:04,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2018-11-18 17:27:04,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:27:04,295 INFO L225 Difference]: With dead ends: 901 [2018-11-18 17:27:04,295 INFO L226 Difference]: Without dead ends: 380 [2018-11-18 17:27:04,296 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 17:27:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-18 17:27:04,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-18 17:27:04,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-18 17:27:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-11-18 17:27:04,307 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 133 [2018-11-18 17:27:04,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:27:04,307 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-11-18 17:27:04,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:27:04,308 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-11-18 17:27:04,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 17:27:04,309 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:27:04,309 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:27:04,309 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:27:04,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:27:04,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1056401542, now seen corresponding path program 1 times [2018-11-18 17:27:04,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:27:04,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:04,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:27:04,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:04,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:27:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:27:04,389 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:27:04,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:27:04,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:27:04,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:27:04,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:27:04,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:27:04,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:27:04,390 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-11-18 17:27:05,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:27:05,185 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-11-18 17:27:05,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 17:27:05,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2018-11-18 17:27:05,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:27:05,189 INFO L225 Difference]: With dead ends: 1193 [2018-11-18 17:27:05,190 INFO L226 Difference]: Without dead ends: 819 [2018-11-18 17:27:05,191 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 17:27:05,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-18 17:27:05,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-11-18 17:27:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-11-18 17:27:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-11-18 17:27:05,216 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 141 [2018-11-18 17:27:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:27:05,216 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-11-18 17:27:05,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:27:05,216 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-11-18 17:27:05,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-18 17:27:05,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:27:05,219 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, 1, 1, 1, 1, 1, 1] [2018-11-18 17:27:05,219 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:27:05,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:27:05,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2142875510, now seen corresponding path program 1 times [2018-11-18 17:27:05,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:27:05,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:05,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:27:05,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:05,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:27:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:27:05,362 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 17:27:05,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:27:05,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:27:05,362 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:27:05,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:27:05,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:27:05,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:27:05,363 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-11-18 17:27:05,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:27:05,916 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-11-18 17:27:05,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 17:27:05,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-11-18 17:27:05,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:27:05,922 INFO L225 Difference]: With dead ends: 1753 [2018-11-18 17:27:05,922 INFO L226 Difference]: Without dead ends: 804 [2018-11-18 17:27:05,924 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 17:27:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-18 17:27:05,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-11-18 17:27:05,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-11-18 17:27:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-11-18 17:27:05,943 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 143 [2018-11-18 17:27:05,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:27:05,943 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-11-18 17:27:05,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:27:05,944 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-11-18 17:27:05,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-18 17:27:05,946 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:27:05,946 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, 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] [2018-11-18 17:27:05,946 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:27:05,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:27:05,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1822889842, now seen corresponding path program 1 times [2018-11-18 17:27:05,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:27:05,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:05,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:27:05,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:05,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:27:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:27:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:27:06,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:27:06,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:27:06,075 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:27:06,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:27:06,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:27:06,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:27:06,076 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-11-18 17:27:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:27:06,474 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-11-18 17:27:06,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 17:27:06,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2018-11-18 17:27:06,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:27:06,477 INFO L225 Difference]: With dead ends: 1747 [2018-11-18 17:27:06,477 INFO L226 Difference]: Without dead ends: 801 [2018-11-18 17:27:06,479 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 17:27:06,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-18 17:27:06,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-18 17:27:06,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-18 17:27:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-11-18 17:27:06,492 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 145 [2018-11-18 17:27:06,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:27:06,493 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-11-18 17:27:06,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:27:06,493 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-11-18 17:27:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-18 17:27:06,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:27:06,495 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, 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 17:27:06,496 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:27:06,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:27:06,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2129057642, now seen corresponding path program 1 times [2018-11-18 17:27:06,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:27:06,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:06,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:27:06,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:06,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:27:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:27:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:27:06,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:27:06,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:27:06,582 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:27:06,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:27:06,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:27:06,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:27:06,583 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-11-18 17:27:07,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:27:07,167 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-11-18 17:27:07,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 17:27:07,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-11-18 17:27:07,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:27:07,175 INFO L225 Difference]: With dead ends: 2381 [2018-11-18 17:27:07,175 INFO L226 Difference]: Without dead ends: 1586 [2018-11-18 17:27:07,178 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 17:27:07,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-11-18 17:27:07,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-11-18 17:27:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-18 17:27:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-11-18 17:27:07,214 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 149 [2018-11-18 17:27:07,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:27:07,215 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-11-18 17:27:07,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:27:07,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-11-18 17:27:07,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-18 17:27:07,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:27:07,220 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:27:07,220 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:27:07,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:27:07,220 INFO L82 PathProgramCache]: Analyzing trace with hash -702189192, now seen corresponding path program 1 times [2018-11-18 17:27:07,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:27:07,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:07,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:27:07,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:07,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:27:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:27:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:27:07,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:27:07,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:27:07,309 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-11-18 17:27:07,310 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], [107], [108], [112], [116], [120], [123], [124], [128], [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], [571], [579], [587], [595], [603], [611], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-18 17:27:07,343 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:27:07,343 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:27:07,874 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 17:27:07,875 INFO L272 AbstractInterpreter]: Visited 122 different actions 238 times. Merged at 5 different actions 5 times. Never widened. Performed 2698 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2698 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 17:27:07,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:27:07,896 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 17:27:08,259 INFO L227 lantSequenceWeakener]: Weakened 181 states. On average, predicates are now at 82.55% of their original sizes. [2018-11-18 17:27:08,259 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 17:27:08,384 INFO L415 sIntCurrentIteration]: We unified 183 AI predicates to 183 [2018-11-18 17:27:08,384 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 17:27:08,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 17:27:08,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-18 17:27:08,385 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:27:08,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 17:27:08,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 17:27:08,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 17:27:08,386 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 10 states. [2018-11-18 17:27:12,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:27:12,899 INFO L93 Difference]: Finished difference Result 3925 states and 5567 transitions. [2018-11-18 17:27:12,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 17:27:12,899 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2018-11-18 17:27:12,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:27:12,904 INFO L225 Difference]: With dead ends: 3925 [2018-11-18 17:27:12,904 INFO L226 Difference]: Without dead ends: 2373 [2018-11-18 17:27:12,907 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 193 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-11-18 17:27:12,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2018-11-18 17:27:12,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2302. [2018-11-18 17:27:12,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2302 states. [2018-11-18 17:27:12,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 3078 transitions. [2018-11-18 17:27:12,940 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 3078 transitions. Word has length 184 [2018-11-18 17:27:12,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:27:12,940 INFO L480 AbstractCegarLoop]: Abstraction has 2302 states and 3078 transitions. [2018-11-18 17:27:12,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 17:27:12,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 3078 transitions. [2018-11-18 17:27:12,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-18 17:27:12,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:27:12,944 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, 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] [2018-11-18 17:27:12,945 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:27:12,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:27:12,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1613721515, now seen corresponding path program 1 times [2018-11-18 17:27:12,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:27:12,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:12,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:27:12,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:12,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:27:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:27:13,128 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:27:13,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:27:13,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:27:13,128 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-11-18 17:27:13,129 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [119], [120], [124], [128], [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], [571], [579], [587], [595], [603], [611], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-18 17:27:13,132 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:27:13,133 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:27:13,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:27:13,390 INFO L272 AbstractInterpreter]: Visited 124 different actions 372 times. Merged at 8 different actions 24 times. Never widened. Performed 4420 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4420 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-18 17:27:13,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:27:13,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:27:13,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:27:13,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5318e4a3-8242-4c33-994e-2eecc35ef73c/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 17:27:13,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:27:13,404 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:27:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:27:13,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:27:13,556 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:27:13,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:27:13,688 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:27:13,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:27:13,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-11-18 17:27:13,717 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:27:13,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 17:27:13,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 17:27:13,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-18 17:27:13,719 INFO L87 Difference]: Start difference. First operand 2302 states and 3078 transitions. Second operand 14 states. [2018-11-18 17:27:15,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:27:15,622 INFO L93 Difference]: Finished difference Result 7743 states and 10793 transitions. [2018-11-18 17:27:15,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 17:27:15,622 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 189 [2018-11-18 17:27:15,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:27:15,628 INFO L225 Difference]: With dead ends: 7743 [2018-11-18 17:27:15,628 INFO L226 Difference]: Without dead ends: 3066 [2018-11-18 17:27:15,636 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 390 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 17:27:15,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2018-11-18 17:27:15,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 3043. [2018-11-18 17:27:15,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3043 states. [2018-11-18 17:27:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 3614 transitions. [2018-11-18 17:27:15,675 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 3614 transitions. Word has length 189 [2018-11-18 17:27:15,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:27:15,675 INFO L480 AbstractCegarLoop]: Abstraction has 3043 states and 3614 transitions. [2018-11-18 17:27:15,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 17:27:15,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 3614 transitions. [2018-11-18 17:27:15,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-11-18 17:27:15,680 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:27:15,680 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 17:27:15,681 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:27:15,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:27:15,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1703504543, now seen corresponding path program 1 times [2018-11-18 17:27:15,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:27:15,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:15,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:27:15,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:15,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:27:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:27:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 232 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:27:16,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:27:16,043 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:27:16,044 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 269 with the following transitions: [2018-11-18 17:27:16,044 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], [571], [579], [587], [595], [603], [611], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-18 17:27:16,047 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:27:16,048 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:27:16,357 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:27:16,357 INFO L272 AbstractInterpreter]: Visited 126 different actions 493 times. Merged at 8 different actions 29 times. Never widened. Performed 5770 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5770 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 17:27:16,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:27:16,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:27:16,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:27:16,360 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5318e4a3-8242-4c33-994e-2eecc35ef73c/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 17:27:16,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:27:16,375 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:27:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:27:16,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:27:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 230 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-18 17:27:16,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:27:16,605 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 230 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-18 17:27:16,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:27:16,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 22 [2018-11-18 17:27:16,630 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:27:16,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 17:27:16,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 17:27:16,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-11-18 17:27:16,631 INFO L87 Difference]: Start difference. First operand 3043 states and 3614 transitions. Second operand 20 states. [2018-11-18 17:27:21,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:27:21,554 INFO L93 Difference]: Finished difference Result 7005 states and 9063 transitions. [2018-11-18 17:27:21,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-18 17:27:21,554 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 268 [2018-11-18 17:27:21,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:27:21,568 INFO L225 Difference]: With dead ends: 7005 [2018-11-18 17:27:21,568 INFO L226 Difference]: Without dead ends: 3740 [2018-11-18 17:27:21,575 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 564 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1971 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1295, Invalid=5185, Unknown=0, NotChecked=0, Total=6480 [2018-11-18 17:27:21,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2018-11-18 17:27:21,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3082. [2018-11-18 17:27:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2018-11-18 17:27:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 3580 transitions. [2018-11-18 17:27:21,659 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 3580 transitions. Word has length 268 [2018-11-18 17:27:21,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:27:21,660 INFO L480 AbstractCegarLoop]: Abstraction has 3082 states and 3580 transitions. [2018-11-18 17:27:21,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 17:27:21,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 3580 transitions. [2018-11-18 17:27:21,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-11-18 17:27:21,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:27:21,667 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:27:21,667 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:27:21,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:27:21,668 INFO L82 PathProgramCache]: Analyzing trace with hash -936896460, now seen corresponding path program 1 times [2018-11-18 17:27:21,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:27:21,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:21,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:27:21,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:21,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:27:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:27:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 178 proven. 13 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 17:27:21,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:27:21,772 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:27:21,772 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 272 with the following transitions: [2018-11-18 17:27:21,772 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], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [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], [571], [579], [587], [595], [603], [611], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-18 17:27:21,775 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:27:21,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:27:22,014 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:27:22,014 INFO L272 AbstractInterpreter]: Visited 124 different actions 366 times. Merged at 7 different actions 18 times. Never widened. Performed 4215 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4215 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-18 17:27:22,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:27:22,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:27:22,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:27:22,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5318e4a3-8242-4c33-994e-2eecc35ef73c/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 17:27:22,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:27:22,026 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:27:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:27:22,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:27:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 198 proven. 2 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-18 17:27:22,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:27:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 178 proven. 13 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 17:27:22,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:27:22,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-18 17:27:22,263 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:27:22,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 17:27:22,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 17:27:22,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-18 17:27:22,264 INFO L87 Difference]: Start difference. First operand 3082 states and 3580 transitions. Second operand 9 states. [2018-11-18 17:27:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:27:23,428 INFO L93 Difference]: Finished difference Result 6217 states and 7251 transitions. [2018-11-18 17:27:23,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 17:27:23,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 271 [2018-11-18 17:27:23,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:27:23,433 INFO L225 Difference]: With dead ends: 6217 [2018-11-18 17:27:23,433 INFO L226 Difference]: Without dead ends: 2205 [2018-11-18 17:27:23,438 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 549 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2018-11-18 17:27:23,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2018-11-18 17:27:23,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2182. [2018-11-18 17:27:23,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2018-11-18 17:27:23,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2474 transitions. [2018-11-18 17:27:23,480 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 2474 transitions. Word has length 271 [2018-11-18 17:27:23,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:27:23,480 INFO L480 AbstractCegarLoop]: Abstraction has 2182 states and 2474 transitions. [2018-11-18 17:27:23,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 17:27:23,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2474 transitions. [2018-11-18 17:27:23,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-11-18 17:27:23,487 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:27:23,487 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 17:27:23,488 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:27:23,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:27:23,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1348455113, now seen corresponding path program 1 times [2018-11-18 17:27:23,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:27:23,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:23,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:27:23,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:27:23,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:27:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:27:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-18 17:27:23,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:27:23,658 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:27:23,659 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 313 with the following transitions: [2018-11-18 17:27:23,660 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], [159], [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], [571], [579], [587], [595], [603], [611], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-18 17:27:23,663 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:27:23,663 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:27:23,991 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:27:23,991 INFO L272 AbstractInterpreter]: Visited 127 different actions 498 times. Merged at 9 different actions 30 times. Never widened. Performed 5869 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5869 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 17:27:23,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:27:23,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:27:23,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:27:23,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5318e4a3-8242-4c33-994e-2eecc35ef73c/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 17:27:24,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:27:24,003 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:27:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:27:24,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:27:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-18 17:27:24,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:27:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-18 17:27:24,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:27:24,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-11-18 17:27:24,185 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:27:24,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:27:24,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:27:24,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:27:24,186 INFO L87 Difference]: Start difference. First operand 2182 states and 2474 transitions. Second operand 6 states. [2018-11-18 17:27:24,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:27:24,446 INFO L93 Difference]: Finished difference Result 3904 states and 4501 transitions. [2018-11-18 17:27:24,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 17:27:24,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 312 [2018-11-18 17:27:24,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:27:24,447 INFO L225 Difference]: With dead ends: 3904 [2018-11-18 17:27:24,447 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 17:27:24,453 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 625 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-18 17:27:24,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 17:27:24,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 17:27:24,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 17:27:24,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 17:27:24,454 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 312 [2018-11-18 17:27:24,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:27:24,454 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 17:27:24,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:27:24,455 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 17:27:24,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 17:27:24,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 17:27:24,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,744 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 139 [2018-11-18 17:27:24,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:27:24,887 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 151 [2018-11-18 17:27:25,056 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 34 [2018-11-18 17:27:25,773 WARN L180 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 77 [2018-11-18 17:27:26,107 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 57 [2018-11-18 17:27:26,459 WARN L180 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 57 [2018-11-18 17:27:26,460 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:27:26,461 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a11~0 |old(~a11~0)|) (= |old(~a17~0)| ~a17~0) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-11-18 17:27:26,461 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:27:26,461 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,461 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,461 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,461 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,461 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,461 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-18 17:27:26,461 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-18 17:27:26,461 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-18 17:27:26,461 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-18 17:27:26,461 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-18 17:27:26,461 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-18 17:27:26,461 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-18 17:27:26,462 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-18 17:27:26,462 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-18 17:27:26,462 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-18 17:27:26,462 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-18 17:27:26,462 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-18 17:27:26,462 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-18 17:27:26,462 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,462 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,462 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,462 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,462 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-18 17:27:26,462 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,462 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-18 17:27:26,462 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-18 17:27:26,462 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-18 17:27:26,462 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-18 17:27:26,462 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-18 17:27:26,463 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-18 17:27:26,463 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-18 17:27:26,463 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-18 17:27:26,463 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-18 17:27:26,463 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-18 17:27:26,463 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-18 17:27:26,463 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-18 17:27:26,463 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-18 17:27:26,463 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-18 17:27:26,463 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-18 17:27:26,463 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,463 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,463 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,463 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,463 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,463 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-18 17:27:26,464 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-18 17:27:26,464 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-18 17:27:26,464 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-18 17:27:26,464 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-18 17:27:26,464 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-18 17:27:26,464 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-18 17:27:26,464 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-18 17:27:26,464 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-18 17:27:26,464 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-18 17:27:26,464 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-18 17:27:26,464 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,464 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,464 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,464 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,464 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,465 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-18 17:27:26,465 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-18 17:27:26,465 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-18 17:27:26,465 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-18 17:27:26,465 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-18 17:27:26,465 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-18 17:27:26,465 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-18 17:27:26,465 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-18 17:27:26,465 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-18 17:27:26,465 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-18 17:27:26,465 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-18 17:27:26,465 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-18 17:27:26,465 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-18 17:27:26,466 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,466 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,466 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,466 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,466 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,466 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-18 17:27:26,466 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-18 17:27:26,466 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-18 17:27:26,466 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-18 17:27:26,466 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-18 17:27:26,466 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-18 17:27:26,466 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-18 17:27:26,466 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-18 17:27:26,466 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-18 17:27:26,466 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-18 17:27:26,466 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-18 17:27:26,467 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-18 17:27:26,467 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-18 17:27:26,467 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-18 17:27:26,467 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-18 17:27:26,467 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-18 17:27:26,467 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,467 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,467 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,467 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,467 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-18 17:27:26,467 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,467 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-18 17:27:26,467 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,467 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-18 17:27:26,467 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-18 17:27:26,467 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-18 17:27:26,467 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,468 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,468 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-18 17:27:26,468 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-18 17:27:26,468 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-18 17:27:26,468 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-18 17:27:26,468 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-18 17:27:26,468 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-18 17:27:26,468 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-18 17:27:26,468 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-18 17:27:26,468 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-18 17:27:26,468 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-18 17:27:26,468 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-18 17:27:26,468 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,468 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,468 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,468 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,469 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,469 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,469 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-18 17:27:26,469 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-18 17:27:26,469 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-18 17:27:26,469 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-18 17:27:26,469 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-18 17:27:26,469 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-18 17:27:26,469 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-18 17:27:26,469 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-18 17:27:26,469 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-18 17:27:26,469 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-18 17:27:26,469 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-18 17:27:26,469 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,469 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,469 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,470 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,470 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,470 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,470 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-18 17:27:26,470 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-18 17:27:26,470 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-18 17:27:26,470 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-18 17:27:26,470 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-18 17:27:26,470 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-18 17:27:26,470 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-18 17:27:26,470 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-18 17:27:26,470 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-18 17:27:26,470 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-18 17:27:26,470 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-18 17:27:26,470 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-18 17:27:26,470 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-18 17:27:26,471 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-18 17:27:26,471 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 505) no Hoare annotation was computed. [2018-11-18 17:27:26,471 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,471 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,471 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,471 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse14 (= |old(~a11~0)| ~a11~0)) (.cse17 (= ~a19~0 |old(~a19~0)|)) (.cse23 (= 1 |old(~a19~0)|)) (.cse15 (= ~a17~0 |old(~a17~0)|)) (.cse12 (= 1 ~a11~0)) (.cse16 (= ~a28~0 |old(~a28~0)|)) (.cse18 (= ~a25~0 |old(~a25~0)|)) (.cse1 (= 1 |old(~a11~0)|)) (.cse19 (= 1 |old(~a25~0)|))) (let ((.cse5 (= 9 |old(~a28~0)|)) (.cse8 (not (= 7 |old(~a28~0)|))) (.cse21 (= 8 ~a17~0)) (.cse13 (= 1 ~a19~0)) (.cse9 (not .cse19)) (.cse20 (not (= 8 |old(~a17~0)|))) (.cse24 (not (= 10 |old(~a28~0)|))) (.cse11 (not .cse1)) (.cse22 (and .cse15 .cse12 .cse16 .cse18)) (.cse2 (= 8 |old(~a28~0)|)) (.cse3 (< 7 |old(~a17~0)|)) (.cse4 (< 10 |old(~a28~0)|)) (.cse0 (not (= 1 ~a21~0))) (.cse10 (not .cse23)) (.cse6 (not (= |old(~a17~0)| 8))) (.cse7 (and .cse14 .cse15 .cse17 .cse16 .cse18))) (and (or .cse0 .cse1 .cse2 (not (= ~a11~0 1)) .cse3) (or .cse4 .cse0 .cse1 .cse2 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse9 .cse10 .cse11 (and .cse12 .cse13) (not (= 7 |old(~a17~0)|))) (or (and .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse4 .cse0 .cse1 .cse5 .cse6 .cse19)) (or .cse0 .cse9 .cse10 .cse20 (and .cse12 (= 1 ~a25~0) (= 9 ~a28~0) .cse21 .cse13) (not .cse5) .cse11) (or .cse4 .cse0 .cse22 .cse2 .cse6 .cse11 .cse19) (or .cse23 .cse0 .cse8 .cse20 (not .cse13) .cse19) (or .cse0 .cse1 .cse9 .cse10 .cse20 (and .cse14 .cse21 .cse17 .cse16 .cse18)) (or .cse13 .cse0 .cse24 .cse9 .cse10 .cse20) (or .cse0 .cse24 .cse6 .cse11 .cse22) (or (and (= |old(~a17~0)| ~a17~0) (= |old(~a25~0)| ~a25~0) .cse16) .cse0 .cse2 .cse3) (or .cse4 .cse0 .cse1 .cse10 .cse6 .cse7)))) [2018-11-18 17:27:26,471 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,471 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,471 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,472 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-18 17:27:26,472 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-18 17:27:26,472 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-18 17:27:26,472 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-18 17:27:26,472 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-18 17:27:26,472 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-18 17:27:26,472 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-18 17:27:26,472 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-18 17:27:26,472 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-18 17:27:26,472 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-18 17:27:26,472 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-18 17:27:26,472 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-18 17:27:26,472 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-18 17:27:26,472 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,472 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,472 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,473 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,473 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,473 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,473 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-18 17:27:26,473 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-18 17:27:26,473 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-18 17:27:26,473 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-18 17:27:26,473 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-18 17:27:26,473 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-18 17:27:26,473 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-18 17:27:26,473 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-18 17:27:26,473 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-18 17:27:26,473 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-18 17:27:26,473 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-18 17:27:26,473 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-18 17:27:26,473 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-18 17:27:26,473 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-18 17:27:26,474 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-18 17:27:26,474 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-11-18 17:27:26,474 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,474 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,474 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,474 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,474 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-11-18 17:27:26,474 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-18 17:27:26,474 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-18 17:27:26,474 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-18 17:27:26,474 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-18 17:27:26,474 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-18 17:27:26,474 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-18 17:27:26,474 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-18 17:27:26,474 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-18 17:27:26,474 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-18 17:27:26,475 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-18 17:27:26,475 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-18 17:27:26,475 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-18 17:27:26,475 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-18 17:27:26,475 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-18 17:27:26,475 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-18 17:27:26,475 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-18 17:27:26,475 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-18 17:27:26,475 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-18 17:27:26,475 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-18 17:27:26,475 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:27:26,475 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 17:27:26,475 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 17:27:26,475 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:27:26,476 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (= ~a11~0 0) (= ~a17~0 8) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-11-18 17:27:26,476 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-18 17:27:26,476 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse5 (= 1 ~a11~0)) (.cse0 (not (= ~a28~0 8))) (.cse7 (= 1 ~a19~0)) (.cse6 (= 8 ~a17~0)) (.cse1 (= ~a11~0 |old(~a11~0)|)) (.cse8 (not (= ~a25~0 1))) (.cse2 (= |old(~a17~0)| ~a17~0)) (.cse3 (<= ~a28~0 10)) (.cse4 (not (= ~a28~0 9)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (<= ~a17~0 7) .cse0) (not (= 0 |old(~a11~0)|)) (and .cse1 .cse2 .cse3 .cse0 .cse4) (and .cse5 (= 9 ~a28~0) .cse6 .cse7) (not (= 0 |old(~a25~0)|)) (and .cse1 .cse2 .cse3 .cse7) (and (and .cse2 (= 10 ~a28~0)) .cse5) (and .cse5 (and .cse8 .cse2 .cse3 .cse0)) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (and .cse1 (= 1 ~a25~0) .cse7 .cse6) (and .cse1 (and .cse8 .cse2 .cse3 .cse4)))) [2018-11-18 17:27:26,476 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-18 17:27:26,476 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-18 17:27:26,476 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse5 (= 1 ~a11~0)) (.cse0 (not (= ~a28~0 8))) (.cse7 (= 1 ~a19~0)) (.cse6 (= 8 ~a17~0)) (.cse1 (= ~a11~0 |old(~a11~0)|)) (.cse8 (not (= ~a25~0 1))) (.cse2 (= |old(~a17~0)| ~a17~0)) (.cse3 (<= ~a28~0 10)) (.cse4 (not (= ~a28~0 9)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (<= ~a17~0 7) .cse0) (not (= 0 |old(~a11~0)|)) (and .cse1 .cse2 .cse3 .cse0 .cse4) (and .cse5 (= 9 ~a28~0) .cse6 .cse7) (not (= 0 |old(~a25~0)|)) (and .cse1 .cse2 .cse3 .cse7) (and (and .cse2 (= 10 ~a28~0)) .cse5) (and .cse5 (and .cse8 .cse2 .cse3 .cse0)) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (and .cse1 (= 1 ~a25~0) .cse7 .cse6) (and .cse1 (and .cse8 .cse2 .cse3 .cse4)))) [2018-11-18 17:27:26,476 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-18 17:27:26,476 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-18 17:27:26,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:27:26 BoogieIcfgContainer [2018-11-18 17:27:26,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 17:27:26,486 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:27:26,486 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:27:26,486 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:27:26,486 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:27:01" (3/4) ... [2018-11-18 17:27:26,489 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 17:27:26,499 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 17:27:26,500 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-18 17:27:26,500 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 17:27:26,509 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-18 17:27:26,510 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 17:27:26,533 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(1 == a21) || !(7 == \old(a28))) || (a17 <= 7 && !(a28 == 8))) || !(0 == \old(a11))) || ((((a11 == \old(a11) && \old(a17) == a17) && a28 <= 10) && !(a28 == 8)) && !(a28 == 9))) || (((1 == a11 && 9 == a28) && 8 == a17) && 1 == a19)) || !(0 == \old(a25))) || (((a11 == \old(a11) && \old(a17) == a17) && a28 <= 10) && 1 == a19)) || ((\old(a17) == a17 && 10 == a28) && 1 == a11)) || (1 == a11 && ((!(a25 == 1) && \old(a17) == a17) && a28 <= 10) && !(a28 == 8))) || !(1 == \old(a19))) || !(8 == \old(a17))) || (((a11 == \old(a11) && 1 == a25) && 1 == a19) && 8 == a17)) || (a11 == \old(a11) && ((!(a25 == 1) && \old(a17) == a17) && a28 <= 10) && !(a28 == 9)) [2018-11-18 17:27:26,599 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5318e4a3-8242-4c33-994e-2eecc35ef73c/bin-2019/utaipan/witness.graphml [2018-11-18 17:27:26,600 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:27:26,600 INFO L168 Benchmark]: Toolchain (without parser) took 26074.05 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 956.6 MB in the beginning and 1.7 GB in the end (delta: -710.7 MB). Peak memory consumption was 407.0 MB. Max. memory is 11.5 GB. [2018-11-18 17:27:26,601 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:27:26,601 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.70 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 919.0 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-11-18 17:27:26,601 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 919.0 MB in the beginning and 1.1 GB in the end (delta: -218.4 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-11-18 17:27:26,601 INFO L168 Benchmark]: Boogie Preprocessor took 58.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 17:27:26,602 INFO L168 Benchmark]: RCFGBuilder took 863.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.0 MB). Peak memory consumption was 99.0 MB. Max. memory is 11.5 GB. [2018-11-18 17:27:26,602 INFO L168 Benchmark]: TraceAbstraction took 24633.52 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 976.2 MB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -637.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-18 17:27:26,602 INFO L168 Benchmark]: Witness Printer took 113.82 ms. Allocated memory is still 2.1 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 45.2 kB). Peak memory consumption was 45.2 kB. Max. memory is 11.5 GB. [2018-11-18 17:27:26,603 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 330.70 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 919.0 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 919.0 MB in the beginning and 1.1 GB in the end (delta: -218.4 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 863.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.0 MB). Peak memory consumption was 99.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24633.52 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 976.2 MB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -637.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 113.82 ms. Allocated memory is still 2.1 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 45.2 kB). Peak memory consumption was 45.2 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 505]: 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))) || (a17 <= 7 && !(a28 == 8))) || !(0 == \old(a11))) || ((((a11 == \old(a11) && \old(a17) == a17) && a28 <= 10) && !(a28 == 8)) && !(a28 == 9))) || (((1 == a11 && 9 == a28) && 8 == a17) && 1 == a19)) || !(0 == \old(a25))) || (((a11 == \old(a11) && \old(a17) == a17) && a28 <= 10) && 1 == a19)) || ((\old(a17) == a17 && 10 == a28) && 1 == a11)) || (1 == a11 && ((!(a25 == 1) && \old(a17) == a17) && a28 <= 10) && !(a28 == 8))) || !(1 == \old(a19))) || !(8 == \old(a17))) || (((a11 == \old(a11) && 1 == a25) && 1 == a19) && 8 == a17)) || (a11 == \old(a11) && ((!(a25 == 1) && \old(a17) == a17) && a28 <= 10) && !(a28 == 9)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 24.5s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 16.7s AutomataDifference, 0.0s DeadEndRemovalTime, 2.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1312 SDtfs, 12054 SDslu, 2229 SDs, 0 SdLazy, 17663 SolverSat, 3212 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 2527 GetRequests, 2325 SyntacticMatches, 13 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2332 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.7s AbstIntTime, 5 AbstIntIterations, 1 AbstIntStrong, 0.9974983518377926 AbsIntWeakeningRatio, 0.18032786885245902 AbsIntAvgWeakeningVarsNumRemoved, 26.25136612021858 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 815 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 136 PreInvPairs, 222 NumberOfFragments, 732 HoareAnnotationTreeSize, 136 FomulaSimplifications, 8152 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 7484 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 3220 NumberOfCodeBlocks, 3220 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4240 ConstructedInterpolants, 0 QuantifiedInterpolants, 3351177 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2344 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 3316/3422 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...