./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label49_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e94c815c-c4a2-4b0a-a356-7a66d9a54cf6/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e94c815c-c4a2-4b0a-a356-7a66d9a54cf6/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e94c815c-c4a2-4b0a-a356-7a66d9a54cf6/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e94c815c-c4a2-4b0a-a356-7a66d9a54cf6/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label49_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e94c815c-c4a2-4b0a-a356-7a66d9a54cf6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e94c815c-c4a2-4b0a-a356-7a66d9a54cf6/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 95000caaa926e46a44fd070da2a40a84b9e2d593 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 01:10:12,847 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 01:10:12,848 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 01:10:12,857 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 01:10:12,857 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 01:10:12,858 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 01:10:12,859 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 01:10:12,860 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 01:10:12,861 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 01:10:12,862 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 01:10:12,862 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 01:10:12,863 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 01:10:12,863 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 01:10:12,864 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 01:10:12,865 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 01:10:12,865 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 01:10:12,866 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 01:10:12,867 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 01:10:12,869 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 01:10:12,870 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 01:10:12,871 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 01:10:12,871 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 01:10:12,873 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 01:10:12,873 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 01:10:12,873 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 01:10:12,874 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 01:10:12,875 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 01:10:12,875 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 01:10:12,876 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 01:10:12,877 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 01:10:12,877 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 01:10:12,877 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 01:10:12,877 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 01:10:12,877 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 01:10:12,878 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 01:10:12,878 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 01:10:12,878 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e94c815c-c4a2-4b0a-a356-7a66d9a54cf6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 01:10:12,889 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 01:10:12,889 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 01:10:12,889 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 01:10:12,890 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 01:10:12,890 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 01:10:12,890 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 01:10:12,890 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 01:10:12,890 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 01:10:12,890 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 01:10:12,890 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 01:10:12,890 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 01:10:12,891 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 01:10:12,891 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 01:10:12,891 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 01:10:12,891 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 01:10:12,891 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 01:10:12,892 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 01:10:12,892 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 01:10:12,892 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 01:10:12,892 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 01:10:12,892 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 01:10:12,892 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 01:10:12,892 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 01:10:12,893 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 01:10:12,893 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 01:10:12,893 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 01:10:12,893 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 01:10:12,893 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 01:10:12,893 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 01:10:12,893 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 01:10:12,893 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 01:10:12,893 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 01:10:12,893 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 01:10:12,893 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 01:10:12,894 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 01:10:12,894 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 01:10:12,894 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_e94c815c-c4a2-4b0a-a356-7a66d9a54cf6/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 -> 95000caaa926e46a44fd070da2a40a84b9e2d593 [2018-12-03 01:10:12,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 01:10:12,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 01:10:12,924 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 01:10:12,925 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 01:10:12,925 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 01:10:12,925 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e94c815c-c4a2-4b0a-a356-7a66d9a54cf6/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label49_true-unreach-call_false-termination.c [2018-12-03 01:10:12,959 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e94c815c-c4a2-4b0a-a356-7a66d9a54cf6/bin-2019/utaipan/data/4a913f8bf/de73419d6178438e9ad6fa7f2da2cc9c/FLAGa5759dc61 [2018-12-03 01:10:13,289 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 01:10:13,290 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e94c815c-c4a2-4b0a-a356-7a66d9a54cf6/sv-benchmarks/c/eca-rers2012/Problem02_label49_true-unreach-call_false-termination.c [2018-12-03 01:10:13,298 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e94c815c-c4a2-4b0a-a356-7a66d9a54cf6/bin-2019/utaipan/data/4a913f8bf/de73419d6178438e9ad6fa7f2da2cc9c/FLAGa5759dc61 [2018-12-03 01:10:13,308 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e94c815c-c4a2-4b0a-a356-7a66d9a54cf6/bin-2019/utaipan/data/4a913f8bf/de73419d6178438e9ad6fa7f2da2cc9c [2018-12-03 01:10:13,311 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 01:10:13,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 01:10:13,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 01:10:13,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 01:10:13,315 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 01:10:13,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:10:13" (1/1) ... [2018-12-03 01:10:13,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2caf47c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:13, skipping insertion in model container [2018-12-03 01:10:13,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:10:13" (1/1) ... [2018-12-03 01:10:13,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 01:10:13,343 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 01:10:13,510 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:10:13,513 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 01:10:13,624 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:10:13,636 INFO L195 MainTranslator]: Completed translation [2018-12-03 01:10:13,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:13 WrapperNode [2018-12-03 01:10:13,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 01:10:13,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 01:10:13,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 01:10:13,637 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 01:10:13,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:13" (1/1) ... [2018-12-03 01:10:13,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:13" (1/1) ... [2018-12-03 01:10:13,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 01:10:13,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 01:10:13,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 01:10:13,656 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 01:10:13,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:13" (1/1) ... [2018-12-03 01:10:13,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:13" (1/1) ... [2018-12-03 01:10:13,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:13" (1/1) ... [2018-12-03 01:10:13,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:13" (1/1) ... [2018-12-03 01:10:13,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:13" (1/1) ... [2018-12-03 01:10:13,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:13" (1/1) ... [2018-12-03 01:10:13,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:13" (1/1) ... [2018-12-03 01:10:13,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 01:10:13,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 01:10:13,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 01:10:13,693 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 01:10:13,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e94c815c-c4a2-4b0a-a356-7a66d9a54cf6/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 01:10:13,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 01:10:13,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 01:10:13,734 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-03 01:10:13,734 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-03 01:10:13,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 01:10:13,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 01:10:13,734 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 01:10:13,734 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 01:10:14,298 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 01:10:14,298 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 01:10:14,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:10:14 BoogieIcfgContainer [2018-12-03 01:10:14,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 01:10:14,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 01:10:14,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 01:10:14,301 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 01:10:14,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 01:10:13" (1/3) ... [2018-12-03 01:10:14,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3461c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:10:14, skipping insertion in model container [2018-12-03 01:10:14,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:13" (2/3) ... [2018-12-03 01:10:14,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3461c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:10:14, skipping insertion in model container [2018-12-03 01:10:14,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:10:14" (3/3) ... [2018-12-03 01:10:14,304 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label49_true-unreach-call_false-termination.c [2018-12-03 01:10:14,311 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 01:10:14,317 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 01:10:14,330 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 01:10:14,357 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 01:10:14,357 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 01:10:14,357 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 01:10:14,357 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 01:10:14,357 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 01:10:14,357 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 01:10:14,357 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 01:10:14,357 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 01:10:14,375 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2018-12-03 01:10:14,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 01:10:14,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:14,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:14,386 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:10:14,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:14,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2010725689, now seen corresponding path program 1 times [2018-12-03 01:10:14,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:10:14,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:14,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:14,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:14,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:10:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:14,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:14,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 01:10:14,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:10:14,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:10:14,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:10:14,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:10:14,695 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2018-12-03 01:10:15,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:15,124 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-12-03 01:10:15,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:10:15,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2018-12-03 01:10:15,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:15,136 INFO L225 Difference]: With dead ends: 618 [2018-12-03 01:10:15,136 INFO L226 Difference]: Without dead ends: 320 [2018-12-03 01:10:15,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:10:15,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-03 01:10:15,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-12-03 01:10:15,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-03 01:10:15,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2018-12-03 01:10:15,184 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 131 [2018-12-03 01:10:15,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:15,185 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2018-12-03 01:10:15,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:10:15,185 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2018-12-03 01:10:15,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 01:10:15,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:15,189 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:15,190 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:10:15,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:15,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2056186306, now seen corresponding path program 1 times [2018-12-03 01:10:15,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:10:15,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:15,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:15,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:15,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:10:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:15,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:15,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:10:15,382 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:10:15,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:10:15,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:10:15,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:10:15,384 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2018-12-03 01:10:15,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:15,718 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2018-12-03 01:10:15,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:10:15,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2018-12-03 01:10:15,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:15,721 INFO L225 Difference]: With dead ends: 721 [2018-12-03 01:10:15,721 INFO L226 Difference]: Without dead ends: 320 [2018-12-03 01:10:15,722 INFO L631 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-12-03 01:10:15,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-03 01:10:15,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-12-03 01:10:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-03 01:10:15,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2018-12-03 01:10:15,733 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 139 [2018-12-03 01:10:15,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:15,733 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2018-12-03 01:10:15,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:10:15,733 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2018-12-03 01:10:15,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 01:10:15,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:15,735 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:15,735 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:10:15,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:15,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1041677834, now seen corresponding path program 1 times [2018-12-03 01:10:15,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:10:15,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:15,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:15,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:15,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:10:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:15,932 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:15,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:15,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:10:15,933 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:10:15,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:10:15,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:10:15,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:10:15,934 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2018-12-03 01:10:16,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:16,232 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2018-12-03 01:10:16,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:10:16,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2018-12-03 01:10:16,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:16,234 INFO L225 Difference]: With dead ends: 717 [2018-12-03 01:10:16,234 INFO L226 Difference]: Without dead ends: 320 [2018-12-03 01:10:16,234 INFO L631 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-12-03 01:10:16,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-03 01:10:16,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-12-03 01:10:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-03 01:10:16,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2018-12-03 01:10:16,242 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 145 [2018-12-03 01:10:16,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:16,242 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2018-12-03 01:10:16,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:10:16,242 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2018-12-03 01:10:16,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 01:10:16,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:16,243 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:16,243 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:10:16,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:16,244 INFO L82 PathProgramCache]: Analyzing trace with hash -33342687, now seen corresponding path program 1 times [2018-12-03 01:10:16,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:10:16,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:16,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:16,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:16,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:10:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:16,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:16,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:10:16,310 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:10:16,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:10:16,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:10:16,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:10:16,311 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2018-12-03 01:10:16,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:16,760 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2018-12-03 01:10:16,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:10:16,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2018-12-03 01:10:16,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:16,763 INFO L225 Difference]: With dead ends: 951 [2018-12-03 01:10:16,763 INFO L226 Difference]: Without dead ends: 637 [2018-12-03 01:10:16,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:10:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-12-03 01:10:16,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2018-12-03 01:10:16,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-12-03 01:10:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 870 transitions. [2018-12-03 01:10:16,776 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 870 transitions. Word has length 153 [2018-12-03 01:10:16,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:16,776 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 870 transitions. [2018-12-03 01:10:16,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:10:16,777 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 870 transitions. [2018-12-03 01:10:16,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-03 01:10:16,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:16,778 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:16,778 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:10:16,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:16,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1756128357, now seen corresponding path program 1 times [2018-12-03 01:10:16,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:10:16,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:16,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:16,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:16,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:10:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:16,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:16,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:10:16,913 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:10:16,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:10:16,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:10:16,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:10:16,914 INFO L87 Difference]: Start difference. First operand 626 states and 870 transitions. Second operand 5 states. [2018-12-03 01:10:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:17,268 INFO L93 Difference]: Finished difference Result 1330 states and 1901 transitions. [2018-12-03 01:10:17,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:10:17,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2018-12-03 01:10:17,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:17,270 INFO L225 Difference]: With dead ends: 1330 [2018-12-03 01:10:17,270 INFO L226 Difference]: Without dead ends: 626 [2018-12-03 01:10:17,271 INFO L631 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-12-03 01:10:17,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-12-03 01:10:17,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2018-12-03 01:10:17,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-12-03 01:10:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 858 transitions. [2018-12-03 01:10:17,280 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 858 transitions. Word has length 155 [2018-12-03 01:10:17,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:17,281 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 858 transitions. [2018-12-03 01:10:17,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:10:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 858 transitions. [2018-12-03 01:10:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 01:10:17,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:17,282 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:17,282 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:10:17,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:17,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1935651415, now seen corresponding path program 1 times [2018-12-03 01:10:17,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:10:17,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:17,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:17,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:17,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:10:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:17,401 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:17,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:17,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:10:17,401 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:10:17,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:10:17,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:10:17,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:10:17,402 INFO L87 Difference]: Start difference. First operand 626 states and 858 transitions. Second operand 5 states. [2018-12-03 01:10:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:17,734 INFO L93 Difference]: Finished difference Result 1332 states and 1876 transitions. [2018-12-03 01:10:17,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:10:17,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2018-12-03 01:10:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:17,736 INFO L225 Difference]: With dead ends: 1332 [2018-12-03 01:10:17,736 INFO L226 Difference]: Without dead ends: 626 [2018-12-03 01:10:17,737 INFO L631 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-12-03 01:10:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-12-03 01:10:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2018-12-03 01:10:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-12-03 01:10:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 842 transitions. [2018-12-03 01:10:17,747 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 842 transitions. Word has length 157 [2018-12-03 01:10:17,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:17,747 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 842 transitions. [2018-12-03 01:10:17,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:10:17,747 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 842 transitions. [2018-12-03 01:10:17,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-03 01:10:17,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:17,749 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:17,749 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:10:17,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:17,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1918345167, now seen corresponding path program 1 times [2018-12-03 01:10:17,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:10:17,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:17,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:17,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:17,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:10:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:17,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:17,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:10:17,806 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:10:17,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:10:17,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:10:17,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:10:17,806 INFO L87 Difference]: Start difference. First operand 626 states and 842 transitions. Second operand 6 states. [2018-12-03 01:10:18,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:18,164 INFO L93 Difference]: Finished difference Result 1858 states and 2598 transitions. [2018-12-03 01:10:18,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:10:18,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2018-12-03 01:10:18,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:18,169 INFO L225 Difference]: With dead ends: 1858 [2018-12-03 01:10:18,169 INFO L226 Difference]: Without dead ends: 1238 [2018-12-03 01:10:18,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:10:18,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2018-12-03 01:10:18,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2018-12-03 01:10:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2018-12-03 01:10:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1635 transitions. [2018-12-03 01:10:18,200 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1635 transitions. Word has length 161 [2018-12-03 01:10:18,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:18,200 INFO L480 AbstractCegarLoop]: Abstraction has 1218 states and 1635 transitions. [2018-12-03 01:10:18,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:10:18,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1635 transitions. [2018-12-03 01:10:18,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-03 01:10:18,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:18,203 INFO L402 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, 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-12-03 01:10:18,204 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:10:18,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:18,204 INFO L82 PathProgramCache]: Analyzing trace with hash 264500657, now seen corresponding path program 1 times [2018-12-03 01:10:18,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:10:18,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:18,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:18,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:18,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:10:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:18,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:10:18,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:10:18,260 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-12-03 01:10:18,261 INFO L205 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], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [727], [729], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-03 01:10:18,292 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:10:18,292 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:10:18,680 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 01:10:18,681 INFO L272 AbstractInterpreter]: Visited 135 different actions 264 times. Merged at 4 different actions 4 times. Never widened. Performed 2967 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2967 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-12-03 01:10:18,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:18,685 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 01:10:18,946 INFO L227 lantSequenceWeakener]: Weakened 192 states. On average, predicates are now at 82.74% of their original sizes. [2018-12-03 01:10:18,946 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 01:10:18,991 INFO L418 sIntCurrentIteration]: We unified 194 AI predicates to 194 [2018-12-03 01:10:18,992 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 01:10:18,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 01:10:18,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-03 01:10:18,992 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:10:18,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 01:10:18,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 01:10:18,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:10:18,993 INFO L87 Difference]: Start difference. First operand 1218 states and 1635 transitions. Second operand 10 states. [2018-12-03 01:10:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:21,940 INFO L93 Difference]: Finished difference Result 3178 states and 4247 transitions. [2018-12-03 01:10:21,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 01:10:21,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195 [2018-12-03 01:10:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:21,946 INFO L225 Difference]: With dead ends: 3178 [2018-12-03 01:10:21,946 INFO L226 Difference]: Without dead ends: 1966 [2018-12-03 01:10:21,948 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 204 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-12-03 01:10:21,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2018-12-03 01:10:21,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1956. [2018-12-03 01:10:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1956 states. [2018-12-03 01:10:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2481 transitions. [2018-12-03 01:10:21,985 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2481 transitions. Word has length 195 [2018-12-03 01:10:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:21,985 INFO L480 AbstractCegarLoop]: Abstraction has 1956 states and 2481 transitions. [2018-12-03 01:10:21,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 01:10:21,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2481 transitions. [2018-12-03 01:10:21,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-03 01:10:21,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:21,991 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:21,991 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:10:21,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:21,991 INFO L82 PathProgramCache]: Analyzing trace with hash -896675840, now seen corresponding path program 1 times [2018-12-03 01:10:21,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:10:21,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:21,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:21,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:21,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:10:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:22,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:10:22,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:10:22,100 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-12-03 01:10:22,101 INFO L205 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], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [727], [729], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-03 01:10:22,103 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:10:22,103 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:10:22,303 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:10:22,303 INFO L272 AbstractInterpreter]: Visited 137 different actions 406 times. Merged at 7 different actions 17 times. Never widened. Performed 4808 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4808 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-12-03 01:10:22,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:22,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:10:22,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:10:22,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e94c815c-c4a2-4b0a-a356-7a66d9a54cf6/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 01:10:22,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:22,313 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:10:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:22,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:10:22,425 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 95 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 01:10:22,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:10:22,499 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 95 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 01:10:22,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 01:10:22,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-12-03 01:10:22,524 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 01:10:22,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 01:10:22,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 01:10:22,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-12-03 01:10:22,525 INFO L87 Difference]: Start difference. First operand 1956 states and 2481 transitions. Second operand 14 states. [2018-12-03 01:10:23,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:23,870 INFO L93 Difference]: Finished difference Result 4947 states and 6363 transitions. [2018-12-03 01:10:23,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 01:10:23,871 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 199 [2018-12-03 01:10:23,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:23,875 INFO L225 Difference]: With dead ends: 4947 [2018-12-03 01:10:23,875 INFO L226 Difference]: Without dead ends: 2395 [2018-12-03 01:10:23,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 410 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 01:10:23,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2018-12-03 01:10:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 2242. [2018-12-03 01:10:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2242 states. [2018-12-03 01:10:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 2660 transitions. [2018-12-03 01:10:23,911 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 2660 transitions. Word has length 199 [2018-12-03 01:10:23,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:23,911 INFO L480 AbstractCegarLoop]: Abstraction has 2242 states and 2660 transitions. [2018-12-03 01:10:23,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 01:10:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 2660 transitions. [2018-12-03 01:10:23,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-12-03 01:10:23,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:23,915 INFO L402 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:23,916 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:10:23,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:23,916 INFO L82 PathProgramCache]: Analyzing trace with hash -2138649182, now seen corresponding path program 1 times [2018-12-03 01:10:23,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:10:23,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:23,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:23,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:23,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:10:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 226 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:24,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:10:24,349 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:10:24,350 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 279 with the following transitions: [2018-12-03 01:10:24,350 INFO L205 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], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [727], [729], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-03 01:10:24,353 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:10:24,353 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:10:24,585 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:10:24,585 INFO L272 AbstractInterpreter]: Visited 139 different actions 543 times. Merged at 7 different actions 24 times. Never widened. Performed 6347 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6347 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 2 different actions. Largest state had 38 variables. [2018-12-03 01:10:24,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:24,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:10:24,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:10:24,587 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e94c815c-c4a2-4b0a-a356-7a66d9a54cf6/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 01:10:24,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:24,593 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:10:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:24,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:10:24,724 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 225 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-03 01:10:24,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:10:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 225 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-03 01:10:24,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 01:10:24,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 22 [2018-12-03 01:10:24,828 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 01:10:24,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 01:10:24,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 01:10:24,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-12-03 01:10:24,829 INFO L87 Difference]: Start difference. First operand 2242 states and 2660 transitions. Second operand 20 states. [2018-12-03 01:10:28,231 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 21 [2018-12-03 01:10:28,673 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2018-12-03 01:10:29,064 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2018-12-03 01:10:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:32,155 INFO L93 Difference]: Finished difference Result 5085 states and 6680 transitions. [2018-12-03 01:10:32,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 01:10:32,157 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 278 [2018-12-03 01:10:32,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:32,174 INFO L225 Difference]: With dead ends: 5085 [2018-12-03 01:10:32,174 INFO L226 Difference]: Without dead ends: 2835 [2018-12-03 01:10:32,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 583 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2020 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1294, Invalid=5348, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 01:10:32,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2018-12-03 01:10:32,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2257. [2018-12-03 01:10:32,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2257 states. [2018-12-03 01:10:32,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 2603 transitions. [2018-12-03 01:10:32,224 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 2603 transitions. Word has length 278 [2018-12-03 01:10:32,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:32,224 INFO L480 AbstractCegarLoop]: Abstraction has 2257 states and 2603 transitions. [2018-12-03 01:10:32,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 01:10:32,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 2603 transitions. [2018-12-03 01:10:32,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-12-03 01:10:32,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:10:32,227 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:32,227 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:10:32,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:32,227 INFO L82 PathProgramCache]: Analyzing trace with hash -687839117, now seen corresponding path program 1 times [2018-12-03 01:10:32,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:10:32,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:32,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:32,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:32,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:10:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:32,296 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 170 proven. 13 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-03 01:10:32,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:10:32,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:10:32,296 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 281 with the following transitions: [2018-12-03 01:10:32,296 INFO L205 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], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [727], [729], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-03 01:10:32,298 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:10:32,298 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:10:32,491 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 01:10:32,491 INFO L272 AbstractInterpreter]: Visited 136 different actions 401 times. Merged at 6 different actions 13 times. Never widened. Performed 4595 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4595 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-12-03 01:10:32,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:32,492 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 01:10:32,672 INFO L227 lantSequenceWeakener]: Weakened 275 states. On average, predicates are now at 84.61% of their original sizes. [2018-12-03 01:10:32,672 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 01:10:32,708 INFO L418 sIntCurrentIteration]: We unified 279 AI predicates to 279 [2018-12-03 01:10:32,708 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 01:10:32,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 01:10:32,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-12-03 01:10:32,708 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:10:32,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 01:10:32,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 01:10:32,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:10:32,709 INFO L87 Difference]: Start difference. First operand 2257 states and 2603 transitions. Second operand 9 states. [2018-12-03 01:10:34,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:34,435 INFO L93 Difference]: Finished difference Result 3959 states and 4626 transitions. [2018-12-03 01:10:34,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 01:10:34,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 280 [2018-12-03 01:10:34,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:10:34,436 INFO L225 Difference]: With dead ends: 3959 [2018-12-03 01:10:34,436 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 01:10:34,438 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 286 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-12-03 01:10:34,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 01:10:34,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 01:10:34,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 01:10:34,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 01:10:34,438 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 280 [2018-12-03 01:10:34,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:10:34,439 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 01:10:34,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 01:10:34,439 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 01:10:34,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 01:10:34,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 01:10:34,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:34,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:10:35,241 WARN L180 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 81 [2018-12-03 01:10:35,609 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 60 [2018-12-03 01:10:35,894 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 65 [2018-12-03 01:10:35,895 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-03 01:10:35,896 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a11~0)| ~a11~0) (= |old(~a17~0)| ~a17~0) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-12-03 01:10:35,896 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 01:10:35,896 INFO L448 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,896 INFO L448 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,896 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,896 INFO L448 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,896 INFO L448 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,896 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-12-03 01:10:35,896 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-12-03 01:10:35,896 INFO L448 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-12-03 01:10:35,896 INFO L448 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-12-03 01:10:35,896 INFO L448 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-12-03 01:10:35,896 INFO L448 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-12-03 01:10:35,896 INFO L448 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-12-03 01:10:35,896 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-12-03 01:10:35,896 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-12-03 01:10:35,896 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-12-03 01:10:35,896 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,897 INFO L448 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-12-03 01:10:35,898 INFO L448 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-12-03 01:10:35,899 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-12-03 01:10:35,900 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 547) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-12-03 01:10:35,901 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,902 INFO L448 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L444 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse19 (= |old(~a11~0)| ~a11~0)) (.cse20 (= ~a28~0 |old(~a28~0)|)) (.cse21 (= ~a25~0 |old(~a25~0)|)) (.cse10 (= 1 |old(~a19~0)|)) (.cse11 (= 1 |old(~a25~0)|)) (.cse18 (= 1 |old(~a11~0)|))) (let ((.cse1 (not (= 7 |old(~a28~0)|))) (.cse5 (= 1 ~a11~0)) (.cse8 (= 8 ~a17~0)) (.cse6 (= 1 ~a19~0)) (.cse4 (not .cse18)) (.cse2 (not .cse11)) (.cse3 (not .cse10)) (.cse16 (= 0 |old(~a28~0)|)) (.cse7 (not (= 8 |old(~a17~0)|))) (.cse17 (= |calculate_output_#in~input| 0)) (.cse14 (and .cse19 (= ~a17~0 8) (= ~a19~0 1) .cse20 .cse21)) (.cse13 (< 10 |old(~a28~0)|)) (.cse9 (= 9 |old(~a28~0)|)) (.cse12 (= |old(~a25~0)| ~a25~0)) (.cse0 (not (= 1 ~a21~0))) (.cse15 (= 8 |old(~a28~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6) (not (= 7 |old(~a17~0)|))) (or .cse0 .cse2 .cse3 .cse7 (and .cse5 (= 1 ~a25~0) (= 9 ~a28~0) .cse8 .cse6) (not .cse9) .cse4) (or .cse10 .cse0 .cse1 .cse7 (and (= 7 ~a28~0) (not (= ~a25~0 1)) .cse5 .cse8 (not .cse6)) .cse4 .cse11) (or (and .cse5 .cse8 .cse6 .cse12 (= 10 ~a28~0)) .cse0 (not (= 10 |old(~a28~0)|)) .cse2 .cse3 .cse7 .cse4) (or .cse13 .cse14 (or .cse0 .cse15 .cse11) .cse3 .cse16 .cse7 .cse17) (or .cse0 .cse18 .cse2 .cse3 .cse16 .cse7 .cse17 .cse14) (or (or .cse13 .cse0 .cse18 .cse9 (not (= |old(~a17~0)| 8))) (and .cse19 (= ~a17~0 |old(~a17~0)|) .cse20 .cse21)) (or (and (= |old(~a17~0)| ~a17~0) .cse12 .cse20) .cse0 .cse15 (< 7 |old(~a17~0)|))))) [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,903 INFO L448 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-12-03 01:10:35,904 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-12-03 01:10:35,905 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-12-03 01:10:35,905 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-12-03 01:10:35,905 INFO L448 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-12-03 01:10:35,905 INFO L448 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-12-03 01:10:35,905 INFO L448 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-12-03 01:10:35,905 INFO L448 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-12-03 01:10:35,905 INFO L448 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-12-03 01:10:35,905 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-12-03 01:10:35,905 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-12-03 01:10:35,905 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-12-03 01:10:35,905 INFO L448 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-12-03 01:10:35,905 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-12-03 01:10:35,905 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-12-03 01:10:35,905 INFO L448 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-12-03 01:10:35,905 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-12-03 01:10:35,905 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-12-03 01:10:35,905 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 01:10:35,905 INFO L444 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-12-03 01:10:35,905 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 01:10:35,905 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 01:10:35,905 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and (= ~a11~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-12-03 01:10:35,906 INFO L444 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse1 (not (= ~a25~0 1))) (.cse0 (not (= ~a28~0 8))) (.cse3 (<= ~a28~0 10)) (.cse5 (= 1 ~a19~0)) (.cse4 (= ~a19~0 1)) (.cse2 (= 8 ~a17~0)) (.cse6 (not (= ~a11~0 1)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (<= ~a17~0 7) .cse0) (not (= 0 |old(~a11~0)|)) (and (= 7 ~a28~0) .cse1 .cse2) (and (not (= ~a28~0 0)) (and .cse1 .cse3 .cse0) (= ~a17~0 8) .cse4) (and (= 9 ~a28~0) .cse2 .cse5) (not (= 0 |old(~a25~0)|)) (and (= |old(~a17~0)| ~a17~0) .cse3 .cse6 (not (= ~a28~0 9))) (not (= 1 |old(~a19~0)|)) (and .cse2 .cse5 (= 10 ~a28~0)) (not (= 8 |old(~a17~0)|)) (and .cse4 (and (= 1 ~a25~0) .cse2 .cse6)))) [2018-12-03 01:10:35,906 INFO L448 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2018-12-03 01:10:35,906 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-12-03 01:10:35,906 INFO L444 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse1 (not (= main_~input~0 0))) (.cse0 (not (= ~a28~0 8))) (.cse2 (= ~a19~0 1)) (.cse6 (not (= ~a25~0 1))) (.cse7 (<= ~a28~0 10)) (.cse5 (not (= ~a11~0 1))) (.cse3 (= 1 ~a25~0)) (.cse4 (= 8 ~a17~0)) (.cse8 (= 1 ~a19~0))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (<= ~a17~0 7) .cse0) (and .cse1 .cse2 (and .cse3 .cse4 .cse5)) (and .cse1 (not (= ~a28~0 0)) (and .cse6 .cse7 .cse0) (= ~a17~0 8) .cse2) (not (= 0 |old(~a11~0)|)) (and (= 7 ~a28~0) .cse6 .cse4 (not .cse8)) (and (= 1 ~a11~0) .cse3 (= 9 ~a28~0) .cse4 .cse8) (not (= 0 |old(~a25~0)|)) (and (= |old(~a17~0)| ~a17~0) .cse7 .cse5 (not (= ~a28~0 9))) (not (= 1 |old(~a19~0)|)) (and .cse3 .cse4 .cse8 (= 10 ~a28~0)) (not (= 8 |old(~a17~0)|)))) [2018-12-03 01:10:35,906 INFO L448 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-12-03 01:10:35,906 INFO L448 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-12-03 01:10:35,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 01:10:35 BoogieIcfgContainer [2018-12-03 01:10:35,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 01:10:35,913 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 01:10:35,913 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 01:10:35,913 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 01:10:35,913 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:10:14" (3/4) ... [2018-12-03 01:10:35,916 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 01:10:35,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 01:10:35,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-12-03 01:10:35,920 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 01:10:35,925 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-03 01:10:35,926 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-03 01:10:35,942 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(1 == a21) || !(7 == \old(a28))) || (a17 <= 7 && !(a28 == 8))) || !(0 == \old(a11))) || ((7 == a28 && !(a25 == 1)) && 8 == a17)) || (((!(a28 == 0) && (!(a25 == 1) && a28 <= 10) && !(a28 == 8)) && a17 == 8) && a19 == 1)) || ((9 == a28 && 8 == a17) && 1 == a19)) || !(0 == \old(a25))) || (((\old(a17) == a17 && a28 <= 10) && !(a11 == 1)) && !(a28 == 9))) || !(1 == \old(a19))) || ((8 == a17 && 1 == a19) && 10 == a28)) || !(8 == \old(a17))) || (a19 == 1 && (1 == a25 && 8 == a17) && !(a11 == 1)) [2018-12-03 01:10:35,986 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e94c815c-c4a2-4b0a-a356-7a66d9a54cf6/bin-2019/utaipan/witness.graphml [2018-12-03 01:10:35,986 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 01:10:35,987 INFO L168 Benchmark]: Toolchain (without parser) took 22675.91 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 780.1 MB). Free memory was 953.5 MB in the beginning and 1.0 GB in the end (delta: -61.2 MB). Peak memory consumption was 718.9 MB. Max. memory is 11.5 GB. [2018-12-03 01:10:35,987 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:10:35,987 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.4 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -100.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. [2018-12-03 01:10:35,988 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:10:35,988 INFO L168 Benchmark]: Boogie Preprocessor took 36.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2018-12-03 01:10:35,988 INFO L168 Benchmark]: RCFGBuilder took 605.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 948.1 MB in the end (delta: 97.9 MB). Peak memory consumption was 97.9 MB. Max. memory is 11.5 GB. [2018-12-03 01:10:35,988 INFO L168 Benchmark]: TraceAbstraction took 21613.59 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 707.8 MB). Free memory was 948.1 MB in the beginning and 1.0 GB in the end (delta: -87.0 MB). Peak memory consumption was 620.8 MB. Max. memory is 11.5 GB. [2018-12-03 01:10:35,988 INFO L168 Benchmark]: Witness Printer took 73.71 ms. Allocated memory is still 1.8 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2018-12-03 01:10:35,989 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 324.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.4 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -100.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 605.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 948.1 MB in the end (delta: 97.9 MB). Peak memory consumption was 97.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21613.59 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 707.8 MB). Free memory was 948.1 MB in the beginning and 1.0 GB in the end (delta: -87.0 MB). Peak memory consumption was 620.8 MB. Max. memory is 11.5 GB. * Witness Printer took 73.71 ms. Allocated memory is still 1.8 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 547]: 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))) || ((7 == a28 && !(a25 == 1)) && 8 == a17)) || (((!(a28 == 0) && (!(a25 == 1) && a28 <= 10) && !(a28 == 8)) && a17 == 8) && a19 == 1)) || ((9 == a28 && 8 == a17) && 1 == a19)) || !(0 == \old(a25))) || (((\old(a17) == a17 && a28 <= 10) && !(a11 == 1)) && !(a28 == 9))) || !(1 == \old(a19))) || ((8 == a17 && 1 == a19) && 10 == a28)) || !(8 == \old(a17))) || (a19 == 1 && (1 == a25 && 8 == a17) && !(a11 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. SAFE Result, 21.5s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 15.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 664 SDtfs, 8250 SDslu, 1133 SDs, 0 SdLazy, 13695 SolverSat, 2360 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1654 GetRequests, 1473 SyntacticMatches, 10 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2285 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2257occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.9973429749641437 AbsIntWeakeningRatio, 0.17124735729386892 AbsIntAvgWeakeningVarsNumRemoved, 26.023255813953487 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 772 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 97 PreInvPairs, 159 NumberOfFragments, 628 HoareAnnotationTreeSize, 97 FomulaSimplifications, 10514 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 6931 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2470 NumberOfCodeBlocks, 2470 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2932 ConstructedInterpolants, 0 QuantifiedInterpolants, 2806504 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1085 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 1464/1547 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...