./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label37_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5359a85b-b42b-4a2b-bbe3-9859349632d6/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5359a85b-b42b-4a2b-bbe3-9859349632d6/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5359a85b-b42b-4a2b-bbe3-9859349632d6/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5359a85b-b42b-4a2b-bbe3-9859349632d6/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label37_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5359a85b-b42b-4a2b-bbe3-9859349632d6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5359a85b-b42b-4a2b-bbe3-9859349632d6/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 b3ccc46b30bd9e1d865272aecfdf21618e4ebade ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 22:22:19,894 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:22:19,896 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:22:19,907 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:22:19,908 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:22:19,908 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:22:19,909 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:22:19,911 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:22:19,912 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:22:19,913 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:22:19,914 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:22:19,914 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:22:19,915 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:22:19,916 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:22:19,917 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:22:19,917 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:22:19,918 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:22:19,919 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:22:19,921 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:22:19,922 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:22:19,923 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:22:19,924 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:22:19,926 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:22:19,926 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:22:19,926 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:22:19,927 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:22:19,928 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:22:19,929 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:22:19,929 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:22:19,930 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:22:19,930 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:22:19,931 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:22:19,931 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:22:19,932 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:22:19,932 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:22:19,933 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:22:19,933 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5359a85b-b42b-4a2b-bbe3-9859349632d6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 22:22:19,946 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:22:19,951 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:22:19,952 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:22:19,952 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 22:22:19,952 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 22:22:19,952 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 22:22:19,952 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 22:22:19,952 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 22:22:19,953 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 22:22:19,953 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 22:22:19,953 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 22:22:19,953 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:22:19,954 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:22:19,954 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:22:19,954 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:22:19,954 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:22:19,954 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:22:19,954 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:22:19,954 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:22:19,954 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:22:19,955 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:22:19,955 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:22:19,957 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:22:19,958 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:22:19,958 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:22:19,958 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:22:19,958 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:22:19,958 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:22:19,958 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:22:19,958 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:22:19,959 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 22:22:19,959 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:22:19,959 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:22:19,959 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 22:22:19,959 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_5359a85b-b42b-4a2b-bbe3-9859349632d6/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 -> b3ccc46b30bd9e1d865272aecfdf21618e4ebade [2018-10-26 22:22:19,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:22:20,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:22:20,008 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:22:20,010 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:22:20,010 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:22:20,011 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5359a85b-b42b-4a2b-bbe3-9859349632d6/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label37_true-unreach-call.c [2018-10-26 22:22:20,059 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5359a85b-b42b-4a2b-bbe3-9859349632d6/bin-2019/utaipan/data/641c6bb9a/c08a3e2aa3aa4381a7096a862a314840/FLAGab07e1c67 [2018-10-26 22:22:20,515 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:22:20,516 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5359a85b-b42b-4a2b-bbe3-9859349632d6/sv-benchmarks/c/eca-rers2012/Problem10_label37_true-unreach-call.c [2018-10-26 22:22:20,525 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5359a85b-b42b-4a2b-bbe3-9859349632d6/bin-2019/utaipan/data/641c6bb9a/c08a3e2aa3aa4381a7096a862a314840/FLAGab07e1c67 [2018-10-26 22:22:20,545 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5359a85b-b42b-4a2b-bbe3-9859349632d6/bin-2019/utaipan/data/641c6bb9a/c08a3e2aa3aa4381a7096a862a314840 [2018-10-26 22:22:20,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:22:20,551 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 22:22:20,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:22:20,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:22:20,556 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:22:20,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:22:20" (1/1) ... [2018-10-26 22:22:20,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443c513d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:20, skipping insertion in model container [2018-10-26 22:22:20,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:22:20" (1/1) ... [2018-10-26 22:22:20,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:22:20,611 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:22:20,937 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:22:20,942 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:22:21,081 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:22:21,106 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:22:21,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21 WrapperNode [2018-10-26 22:22:21,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:22:21,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:22:21,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:22:21,107 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:22:21,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (1/1) ... [2018-10-26 22:22:21,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (1/1) ... [2018-10-26 22:22:21,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:22:21,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:22:21,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:22:21,316 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:22:21,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (1/1) ... [2018-10-26 22:22:21,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (1/1) ... [2018-10-26 22:22:21,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (1/1) ... [2018-10-26 22:22:21,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (1/1) ... [2018-10-26 22:22:21,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (1/1) ... [2018-10-26 22:22:21,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (1/1) ... [2018-10-26 22:22:21,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (1/1) ... [2018-10-26 22:22:21,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:22:21,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:22:21,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:22:21,397 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:22:21,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5359a85b-b42b-4a2b-bbe3-9859349632d6/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-10-26 22:22:21,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:22:21,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:22:21,453 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-26 22:22:21,453 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-26 22:22:21,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:22:21,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:22:21,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:22:21,454 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:22:24,084 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:22:24,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:22:24 BoogieIcfgContainer [2018-10-26 22:22:24,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:22:24,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:22:24,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:22:24,090 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:22:24,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:22:20" (1/3) ... [2018-10-26 22:22:24,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e88a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:22:24, skipping insertion in model container [2018-10-26 22:22:24,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:22:21" (2/3) ... [2018-10-26 22:22:24,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e88a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:22:24, skipping insertion in model container [2018-10-26 22:22:24,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:22:24" (3/3) ... [2018-10-26 22:22:24,094 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label37_true-unreach-call.c [2018-10-26 22:22:24,103 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:22:24,110 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:22:24,124 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:22:24,153 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:22:24,153 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:22:24,153 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:22:24,153 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:22:24,153 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:22:24,155 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:22:24,155 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:22:24,156 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:22:24,175 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-10-26 22:22:24,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-26 22:22:24,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:24,184 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:22:24,186 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:24,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:24,192 INFO L82 PathProgramCache]: Analyzing trace with hash -890432215, now seen corresponding path program 1 times [2018-10-26 22:22:24,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:22:24,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:24,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:24,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:24,236 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:22:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:22:24,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:22:24,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:22:24,612 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:22:24,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:22:24,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:22:24,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:22:24,634 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 4 states. [2018-10-26 22:22:26,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:26,347 INFO L93 Difference]: Finished difference Result 737 states and 1298 transitions. [2018-10-26 22:22:26,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:22:26,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-10-26 22:22:26,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:26,362 INFO L225 Difference]: With dead ends: 737 [2018-10-26 22:22:26,362 INFO L226 Difference]: Without dead ends: 515 [2018-10-26 22:22:26,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:22:26,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-10-26 22:22:26,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 356. [2018-10-26 22:22:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-26 22:22:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 579 transitions. [2018-10-26 22:22:26,427 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 579 transitions. Word has length 61 [2018-10-26 22:22:26,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:26,428 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 579 transitions. [2018-10-26 22:22:26,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:22:26,428 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 579 transitions. [2018-10-26 22:22:26,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-26 22:22:26,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:26,434 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 22:22:26,434 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:26,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:26,435 INFO L82 PathProgramCache]: Analyzing trace with hash 833383459, now seen corresponding path program 1 times [2018-10-26 22:22:26,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:22:26,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:26,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:26,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:26,436 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:22:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:22:26,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:22:26,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 22:22:26,655 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:22:26,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 22:22:26,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 22:22:26,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:22:26,657 INFO L87 Difference]: Start difference. First operand 356 states and 579 transitions. Second operand 6 states. [2018-10-26 22:22:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:28,842 INFO L93 Difference]: Finished difference Result 1259 states and 2162 transitions. [2018-10-26 22:22:28,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:22:28,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2018-10-26 22:22:28,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:28,850 INFO L225 Difference]: With dead ends: 1259 [2018-10-26 22:22:28,850 INFO L226 Difference]: Without dead ends: 909 [2018-10-26 22:22:28,855 INFO L605 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-10-26 22:22:28,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-10-26 22:22:28,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 895. [2018-10-26 22:22:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-10-26 22:22:28,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1370 transitions. [2018-10-26 22:22:28,899 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1370 transitions. Word has length 136 [2018-10-26 22:22:28,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:28,900 INFO L481 AbstractCegarLoop]: Abstraction has 895 states and 1370 transitions. [2018-10-26 22:22:28,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 22:22:28,900 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1370 transitions. [2018-10-26 22:22:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-26 22:22:28,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:28,905 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 22:22:28,905 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:28,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:28,905 INFO L82 PathProgramCache]: Analyzing trace with hash 487326791, now seen corresponding path program 1 times [2018-10-26 22:22:28,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:22:28,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:28,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:28,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:28,906 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:22:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:22:29,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:22:29,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 22:22:29,098 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:22:29,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 22:22:29,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 22:22:29,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:22:29,099 INFO L87 Difference]: Start difference. First operand 895 states and 1370 transitions. Second operand 6 states. [2018-10-26 22:22:31,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:31,157 INFO L93 Difference]: Finished difference Result 2358 states and 3764 transitions. [2018-10-26 22:22:31,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:22:31,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2018-10-26 22:22:31,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:31,165 INFO L225 Difference]: With dead ends: 2358 [2018-10-26 22:22:31,165 INFO L226 Difference]: Without dead ends: 1469 [2018-10-26 22:22:31,169 INFO L605 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-10-26 22:22:31,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-10-26 22:22:31,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1450. [2018-10-26 22:22:31,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2018-10-26 22:22:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 2107 transitions. [2018-10-26 22:22:31,212 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 2107 transitions. Word has length 138 [2018-10-26 22:22:31,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:31,213 INFO L481 AbstractCegarLoop]: Abstraction has 1450 states and 2107 transitions. [2018-10-26 22:22:31,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 22:22:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2107 transitions. [2018-10-26 22:22:31,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-26 22:22:31,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:31,217 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 22:22:31,217 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:31,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:31,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1877603308, now seen corresponding path program 1 times [2018-10-26 22:22:31,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:22:31,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:31,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:31,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:31,219 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:22:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:31,360 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:22:31,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:22:31,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:22:31,360 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:22:31,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:22:31,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:22:31,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:22:31,361 INFO L87 Difference]: Start difference. First operand 1450 states and 2107 transitions. Second operand 4 states. [2018-10-26 22:22:32,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:32,137 INFO L93 Difference]: Finished difference Result 3188 states and 4711 transitions. [2018-10-26 22:22:32,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:22:32,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-10-26 22:22:32,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:32,147 INFO L225 Difference]: With dead ends: 3188 [2018-10-26 22:22:32,147 INFO L226 Difference]: Without dead ends: 1744 [2018-10-26 22:22:32,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:22:32,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2018-10-26 22:22:32,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1742. [2018-10-26 22:22:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2018-10-26 22:22:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 2373 transitions. [2018-10-26 22:22:32,193 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 2373 transitions. Word has length 141 [2018-10-26 22:22:32,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:32,194 INFO L481 AbstractCegarLoop]: Abstraction has 1742 states and 2373 transitions. [2018-10-26 22:22:32,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:22:32,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2373 transitions. [2018-10-26 22:22:32,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-26 22:22:32,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:32,198 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 22:22:32,199 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:32,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:32,200 INFO L82 PathProgramCache]: Analyzing trace with hash -497008844, now seen corresponding path program 1 times [2018-10-26 22:22:32,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:22:32,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:32,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:32,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:32,201 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:22:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:22:32,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:22:32,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 22:22:32,403 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:22:32,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 22:22:32,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 22:22:32,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:22:32,404 INFO L87 Difference]: Start difference. First operand 1742 states and 2373 transitions. Second operand 6 states. [2018-10-26 22:22:33,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:33,597 INFO L93 Difference]: Finished difference Result 3994 states and 5608 transitions. [2018-10-26 22:22:33,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:22:33,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2018-10-26 22:22:33,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:33,609 INFO L225 Difference]: With dead ends: 3994 [2018-10-26 22:22:33,609 INFO L226 Difference]: Without dead ends: 2258 [2018-10-26 22:22:33,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 22:22:33,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2018-10-26 22:22:33,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2208. [2018-10-26 22:22:33,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2208 states. [2018-10-26 22:22:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 2886 transitions. [2018-10-26 22:22:33,672 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 2886 transitions. Word has length 157 [2018-10-26 22:22:33,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:33,672 INFO L481 AbstractCegarLoop]: Abstraction has 2208 states and 2886 transitions. [2018-10-26 22:22:33,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 22:22:33,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 2886 transitions. [2018-10-26 22:22:33,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-26 22:22:33,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:22:33,680 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-10-26 22:22:33,680 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:22:33,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:33,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1003336825, now seen corresponding path program 1 times [2018-10-26 22:22:33,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:22:33,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:33,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:22:33,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:22:33,681 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:22:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-10-26 22:22:33,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:22:33,891 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:22:33,891 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2018-10-26 22:22:33,893 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [538], [539], [543], [547], [551], [555], [559], [563], [567], [570], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-26 22:22:33,945 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:22:33,946 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:22:35,748 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 22:22:36,116 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 22:22:36,118 INFO L272 AbstractInterpreter]: Visited 94 different actions 94 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-26 22:22:36,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:22:36,144 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 22:22:38,544 INFO L227 lantSequenceWeakener]: Weakened 210 states. On average, predicates are now at 73.9% of their original sizes. [2018-10-26 22:22:38,546 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 22:22:41,906 INFO L415 sIntCurrentIteration]: We unified 230 AI predicates to 230 [2018-10-26 22:22:41,907 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 22:22:41,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:22:41,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-10-26 22:22:41,908 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:22:41,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 22:22:41,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 22:22:41,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-10-26 22:22:41,909 INFO L87 Difference]: Start difference. First operand 2208 states and 2886 transitions. Second operand 10 states. [2018-10-26 22:23:19,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:23:19,724 INFO L93 Difference]: Finished difference Result 4559 states and 5978 transitions. [2018-10-26 22:23:19,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 22:23:19,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 231 [2018-10-26 22:23:19,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:23:19,733 INFO L225 Difference]: With dead ends: 4559 [2018-10-26 22:23:19,734 INFO L226 Difference]: Without dead ends: 2357 [2018-10-26 22:23:19,739 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 234 GetRequests, 194 SyntacticMatches, 28 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-10-26 22:23:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2018-10-26 22:23:19,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2352. [2018-10-26 22:23:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2352 states. [2018-10-26 22:23:19,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 3038 transitions. [2018-10-26 22:23:19,816 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 3038 transitions. Word has length 231 [2018-10-26 22:23:19,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:23:19,816 INFO L481 AbstractCegarLoop]: Abstraction has 2352 states and 3038 transitions. [2018-10-26 22:23:19,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 22:23:19,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 3038 transitions. [2018-10-26 22:23:19,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-26 22:23:19,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:23:19,824 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-10-26 22:23:19,825 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:23:19,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:23:19,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1827733875, now seen corresponding path program 1 times [2018-10-26 22:23:19,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:23:19,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:23:19,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:23:19,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:23:19,826 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:23:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:23:20,049 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-26 22:23:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-26 22:23:20,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:23:20,114 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:23:20,114 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 264 with the following transitions: [2018-10-26 22:23:20,115 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [702], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-26 22:23:20,119 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:23:20,120 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:23:21,454 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 22:23:35,301 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 22:23:35,302 INFO L272 AbstractInterpreter]: Visited 130 different actions 750 times. Merged at 5 different actions 25 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-26 22:23:35,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:23:35,315 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 22:23:37,141 INFO L227 lantSequenceWeakener]: Weakened 78 states. On average, predicates are now at 75% of their original sizes. [2018-10-26 22:23:37,141 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 22:24:01,555 INFO L415 sIntCurrentIteration]: We unified 262 AI predicates to 262 [2018-10-26 22:24:01,555 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 22:24:01,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:24:01,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [8] total 28 [2018-10-26 22:24:01,556 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:24:01,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-26 22:24:01,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-26 22:24:01,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-10-26 22:24:01,557 INFO L87 Difference]: Start difference. First operand 2352 states and 3038 transitions. Second operand 22 states. [2018-10-26 22:25:47,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:25:47,674 INFO L93 Difference]: Finished difference Result 5829 states and 7525 transitions. [2018-10-26 22:25:47,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-26 22:25:47,674 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 263 [2018-10-26 22:25:47,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:25:47,683 INFO L225 Difference]: With dead ends: 5829 [2018-10-26 22:25:47,684 INFO L226 Difference]: Without dead ends: 3627 [2018-10-26 22:25:47,690 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 273 GetRequests, 201 SyntacticMatches, 41 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2018-10-26 22:25:47,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3627 states. [2018-10-26 22:25:47,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3627 to 3622. [2018-10-26 22:25:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3622 states. [2018-10-26 22:25:47,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 4414 transitions. [2018-10-26 22:25:47,845 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 4414 transitions. Word has length 263 [2018-10-26 22:25:47,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:25:47,845 INFO L481 AbstractCegarLoop]: Abstraction has 3622 states and 4414 transitions. [2018-10-26 22:25:47,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-26 22:25:47,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 4414 transitions. [2018-10-26 22:25:47,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-26 22:25:47,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:25:47,856 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:25:47,857 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:25:47,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:25:47,857 INFO L82 PathProgramCache]: Analyzing trace with hash -300014035, now seen corresponding path program 1 times [2018-10-26 22:25:47,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:25:47,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:25:47,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:25:47,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:25:47,858 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:25:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:25:48,413 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 121 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:25:48,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:25:48,413 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:25:48,413 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-10-26 22:25:48,414 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [570], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-26 22:25:48,418 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:25:48,418 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:25:54,700 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 22:25:54,700 INFO L272 AbstractInterpreter]: Visited 143 different actions 417 times. Merged at 5 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-26 22:25:54,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:25:54,707 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 22:25:55,949 INFO L227 lantSequenceWeakener]: Weakened 59 states. On average, predicates are now at 77.12% of their original sizes. [2018-10-26 22:25:55,949 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 22:26:08,681 INFO L415 sIntCurrentIteration]: We unified 284 AI predicates to 284 [2018-10-26 22:26:08,681 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 22:26:08,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:26:08,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [14] total 35 [2018-10-26 22:26:08,682 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:26:08,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-26 22:26:08,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-26 22:26:08,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2018-10-26 22:26:08,683 INFO L87 Difference]: Start difference. First operand 3622 states and 4414 transitions. Second operand 23 states. [2018-10-26 22:26:20,390 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 22:28:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:28:09,097 INFO L93 Difference]: Finished difference Result 6798 states and 8478 transitions. [2018-10-26 22:28:09,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-26 22:28:09,097 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 285 [2018-10-26 22:28:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:28:09,104 INFO L225 Difference]: With dead ends: 6798 [2018-10-26 22:28:09,104 INFO L226 Difference]: Without dead ends: 3931 [2018-10-26 22:28:09,109 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 297 GetRequests, 247 SyntacticMatches, 16 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=235, Invalid=1025, Unknown=0, NotChecked=0, Total=1260 [2018-10-26 22:28:09,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3931 states. [2018-10-26 22:28:09,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3931 to 3770. [2018-10-26 22:28:09,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3770 states. [2018-10-26 22:28:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3770 states to 3770 states and 4582 transitions. [2018-10-26 22:28:09,278 INFO L78 Accepts]: Start accepts. Automaton has 3770 states and 4582 transitions. Word has length 285 [2018-10-26 22:28:09,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:28:09,278 INFO L481 AbstractCegarLoop]: Abstraction has 3770 states and 4582 transitions. [2018-10-26 22:28:09,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-26 22:28:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3770 states and 4582 transitions. [2018-10-26 22:28:09,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-26 22:28:09,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:28:09,290 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 22:28:09,290 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:28:09,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:28:09,291 INFO L82 PathProgramCache]: Analyzing trace with hash -434173317, now seen corresponding path program 1 times [2018-10-26 22:28:09,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:28:09,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:28:09,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:28:09,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:28:09,293 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:28:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:28:09,580 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-26 22:28:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 22:28:09,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:28:09,693 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:28:09,694 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 300 with the following transitions: [2018-10-26 22:28:09,694 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [702], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-26 22:28:09,698 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:28:09,698 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:28:11,374 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 22:28:19,158 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 22:28:19,159 INFO L272 AbstractInterpreter]: Visited 130 different actions 507 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-26 22:28:19,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:28:19,167 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 22:28:20,481 INFO L227 lantSequenceWeakener]: Weakened 69 states. On average, predicates are now at 76.48% of their original sizes. [2018-10-26 22:28:20,481 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 22:28:33,897 INFO L415 sIntCurrentIteration]: We unified 298 AI predicates to 298 [2018-10-26 22:28:33,897 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 22:28:33,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:28:33,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [4] total 24 [2018-10-26 22:28:33,898 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:28:33,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-26 22:28:33,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-26 22:28:33,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2018-10-26 22:28:33,899 INFO L87 Difference]: Start difference. First operand 3770 states and 4582 transitions. Second operand 22 states. [2018-10-26 22:30:28,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:30:28,736 INFO L93 Difference]: Finished difference Result 7556 states and 9546 transitions. [2018-10-26 22:30:28,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-26 22:30:28,736 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 299 [2018-10-26 22:30:28,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:30:28,752 INFO L225 Difference]: With dead ends: 7556 [2018-10-26 22:30:28,752 INFO L226 Difference]: Without dead ends: 4687 [2018-10-26 22:30:28,760 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 310 GetRequests, 260 SyntacticMatches, 18 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2018-10-26 22:30:28,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2018-10-26 22:30:28,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4662. [2018-10-26 22:30:28,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4662 states. [2018-10-26 22:30:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4662 states to 4662 states and 5697 transitions. [2018-10-26 22:30:28,988 INFO L78 Accepts]: Start accepts. Automaton has 4662 states and 5697 transitions. Word has length 299 [2018-10-26 22:30:28,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:30:28,988 INFO L481 AbstractCegarLoop]: Abstraction has 4662 states and 5697 transitions. [2018-10-26 22:30:28,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-26 22:30:28,988 INFO L276 IsEmpty]: Start isEmpty. Operand 4662 states and 5697 transitions. [2018-10-26 22:30:29,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-26 22:30:29,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:30:29,002 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-26 22:30:29,002 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:30:29,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:30:29,003 INFO L82 PathProgramCache]: Analyzing trace with hash -870256577, now seen corresponding path program 1 times [2018-10-26 22:30:29,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:30:29,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:30:29,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:30:29,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:30:29,006 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:30:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:30:29,303 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-26 22:30:29,501 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2018-10-26 22:30:29,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:30:29,501 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:30:29,502 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 309 with the following transitions: [2018-10-26 22:30:29,502 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [563], [567], [570], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-26 22:30:29,507 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:30:29,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:30:30,248 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 22:30:35,627 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 22:30:35,627 INFO L272 AbstractInterpreter]: Visited 98 different actions 465 times. Merged at 5 different actions 19 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-26 22:30:35,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:30:35,639 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 22:30:36,848 INFO L227 lantSequenceWeakener]: Weakened 88 states. On average, predicates are now at 75.7% of their original sizes. [2018-10-26 22:30:36,848 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 22:30:45,577 INFO L415 sIntCurrentIteration]: We unified 307 AI predicates to 307 [2018-10-26 22:30:45,577 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 22:30:45,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:30:45,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [4] total 23 [2018-10-26 22:30:45,578 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:30:45,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-26 22:30:45,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-26 22:30:45,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-10-26 22:30:45,579 INFO L87 Difference]: Start difference. First operand 4662 states and 5697 transitions. Second operand 21 states. [2018-10-26 22:32:34,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:32:34,610 INFO L93 Difference]: Finished difference Result 8663 states and 10802 transitions. [2018-10-26 22:32:34,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-26 22:32:34,610 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 308 [2018-10-26 22:32:34,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:32:34,622 INFO L225 Difference]: With dead ends: 8663 [2018-10-26 22:32:34,622 INFO L226 Difference]: Without dead ends: 5194 [2018-10-26 22:32:34,628 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 325 GetRequests, 278 SyntacticMatches, 10 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=273, Invalid=1209, Unknown=0, NotChecked=0, Total=1482 [2018-10-26 22:32:34,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5194 states. [2018-10-26 22:32:34,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5194 to 5185. [2018-10-26 22:32:34,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5185 states. [2018-10-26 22:32:34,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5185 states to 5185 states and 6301 transitions. [2018-10-26 22:32:34,882 INFO L78 Accepts]: Start accepts. Automaton has 5185 states and 6301 transitions. Word has length 308 [2018-10-26 22:32:34,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:32:34,883 INFO L481 AbstractCegarLoop]: Abstraction has 5185 states and 6301 transitions. [2018-10-26 22:32:34,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-26 22:32:34,883 INFO L276 IsEmpty]: Start isEmpty. Operand 5185 states and 6301 transitions. [2018-10-26 22:32:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-26 22:32:34,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:32:34,896 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 22:32:34,896 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:32:34,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:32:34,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1518939421, now seen corresponding path program 1 times [2018-10-26 22:32:34,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:32:34,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:32:34,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:32:34,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:32:34,898 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:32:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:32:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-26 22:32:35,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:32:35,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:32:35,083 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:32:35,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:32:35,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:32:35,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:32:35,084 INFO L87 Difference]: Start difference. First operand 5185 states and 6301 transitions. Second operand 4 states. [2018-10-26 22:32:35,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:32:35,889 INFO L93 Difference]: Finished difference Result 11411 states and 14532 transitions. [2018-10-26 22:32:35,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:32:35,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 319 [2018-10-26 22:32:35,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:32:35,893 INFO L225 Difference]: With dead ends: 11411 [2018-10-26 22:32:35,893 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 22:32:35,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:32:35,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 22:32:35,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 22:32:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 22:32:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 22:32:35,910 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 319 [2018-10-26 22:32:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:32:35,910 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 22:32:35,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:32:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 22:32:35,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 22:32:35,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 22:32:36,062 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 362 [2018-10-26 22:32:37,509 WARN L179 SmtUtils]: Spent 1.44 s on a formula simplification that was a NOOP. DAG size: 1183 [2018-10-26 22:32:38,996 WARN L179 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 1444 DAG size of output: 1444 [2018-10-26 22:32:39,849 WARN L179 SmtUtils]: Spent 849.00 ms on a formula simplification that was a NOOP. DAG size: 1331 [2018-10-26 22:32:42,097 WARN L179 SmtUtils]: Spent 2.24 s on a formula simplification that was a NOOP. DAG size: 1439 [2018-10-26 22:32:42,996 WARN L179 SmtUtils]: Spent 894.00 ms on a formula simplification that was a NOOP. DAG size: 1333 [2018-10-26 22:32:45,188 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 1874 DAG size of output: 1874 [2018-10-26 22:32:46,036 WARN L179 SmtUtils]: Spent 836.00 ms on a formula simplification that was a NOOP. DAG size: 1330 [2018-10-26 22:32:51,352 WARN L179 SmtUtils]: Spent 5.30 s on a formula simplification. DAG size of input: 2204 DAG size of output: 2204 [2018-10-26 22:32:51,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 22:33:01,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 22:33:08,815 WARN L179 SmtUtils]: Spent 17.43 s on a formula simplification. DAG size of input: 2868 DAG size of output: 2745 [2018-10-26 22:33:09,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 22:33:26,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 22:33:29,587 WARN L179 SmtUtils]: Spent 20.76 s on a formula simplification. DAG size of input: 2854 DAG size of output: 2812 [2018-10-26 22:33:30,268 WARN L179 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 44 [2018-10-26 22:33:43,513 WARN L179 SmtUtils]: Spent 13.23 s on a formula simplification. DAG size of input: 920 DAG size of output: 73 [2018-10-26 22:34:48,200 WARN L179 SmtUtils]: Spent 1.08 m on a formula simplification. DAG size of input: 2268 DAG size of output: 256 [2018-10-26 22:35:01,910 WARN L179 SmtUtils]: Spent 13.69 s on a formula simplification. DAG size of input: 2154 DAG size of output: 81 [2018-10-26 22:35:21,205 WARN L179 SmtUtils]: Spent 19.28 s on a formula simplification. DAG size of input: 2199 DAG size of output: 81 [2018-10-26 22:35:21,206 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-26 22:35:21,207 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a19~0)| ~a19~0) (= |old(~a10~0)| ~a10~0)) [2018-10-26 22:35:21,207 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 22:35:21,207 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-10-26 22:35:21,207 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,207 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,207 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,207 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,207 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,207 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,207 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-10-26 22:35:21,207 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-10-26 22:35:21,207 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-10-26 22:35:21,208 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-10-26 22:35:21,208 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-10-26 22:35:21,208 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-10-26 22:35:21,208 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-10-26 22:35:21,208 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-10-26 22:35:21,208 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-10-26 22:35:21,208 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-10-26 22:35:21,208 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-10-26 22:35:21,208 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,208 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,208 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,208 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,208 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,208 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-10-26 22:35:21,208 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-10-26 22:35:21,208 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-10-26 22:35:21,209 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-10-26 22:35:21,209 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-10-26 22:35:21,209 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-10-26 22:35:21,209 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-10-26 22:35:21,209 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-10-26 22:35:21,209 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-10-26 22:35:21,209 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-10-26 22:35:21,209 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-10-26 22:35:21,209 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-10-26 22:35:21,209 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-10-26 22:35:21,209 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-10-26 22:35:21,209 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,209 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,209 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,209 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,209 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,210 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-10-26 22:35:21,210 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-10-26 22:35:21,210 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-10-26 22:35:21,210 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-10-26 22:35:21,210 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-10-26 22:35:21,210 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-10-26 22:35:21,210 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-10-26 22:35:21,210 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-10-26 22:35:21,210 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-10-26 22:35:21,210 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-10-26 22:35:21,210 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,210 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,210 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,210 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,210 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,210 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-10-26 22:35:21,211 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-10-26 22:35:21,211 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-10-26 22:35:21,211 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-10-26 22:35:21,211 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-10-26 22:35:21,211 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-10-26 22:35:21,211 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-10-26 22:35:21,211 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-10-26 22:35:21,211 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-10-26 22:35:21,211 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-10-26 22:35:21,211 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-10-26 22:35:21,211 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-10-26 22:35:21,211 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-10-26 22:35:21,211 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,211 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,211 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,212 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,212 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,212 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-10-26 22:35:21,212 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-10-26 22:35:21,212 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-10-26 22:35:21,212 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-10-26 22:35:21,212 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-10-26 22:35:21,212 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-10-26 22:35:21,212 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-10-26 22:35:21,212 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-10-26 22:35:21,212 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-10-26 22:35:21,212 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,212 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,212 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,212 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,212 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,213 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,213 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,213 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-10-26 22:35:21,213 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-10-26 22:35:21,213 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-10-26 22:35:21,213 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-10-26 22:35:21,213 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-10-26 22:35:21,213 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-10-26 22:35:21,213 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-10-26 22:35:21,213 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-10-26 22:35:21,213 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-10-26 22:35:21,213 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-10-26 22:35:21,213 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-10-26 22:35:21,213 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-10-26 22:35:21,213 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-10-26 22:35:21,213 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,214 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,214 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,214 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,214 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-10-26 22:35:21,214 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,214 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,214 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-10-26 22:35:21,214 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-10-26 22:35:21,214 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-10-26 22:35:21,214 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-10-26 22:35:21,214 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-10-26 22:35:21,214 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-10-26 22:35:21,214 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-10-26 22:35:21,214 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-10-26 22:35:21,214 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-26 22:35:21,214 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-10-26 22:35:21,215 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-10-26 22:35:21,215 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-10-26 22:35:21,215 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-10-26 22:35:21,215 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,215 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,215 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,215 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,215 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,215 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,215 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-10-26 22:35:21,215 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-10-26 22:35:21,215 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-10-26 22:35:21,215 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-10-26 22:35:21,215 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-10-26 22:35:21,216 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-10-26 22:35:21,216 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-10-26 22:35:21,216 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-10-26 22:35:21,216 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-26 22:35:21,216 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-10-26 22:35:21,216 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-10-26 22:35:21,217 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse41 (+ |old(~a1~0)| |old(~a10~0)|))) (let ((.cse9 (< 9 (+ |old(~a19~0)| ~a12~0))) (.cse22 (< (+ |old(~a19~0)| |old(~a1~0)|) 32)) (.cse10 (< ~a4~0 (+ |calculate_output_#in~input| 8))) (.cse11 (< (+ |calculate_output_#in~input| ~a12~0) 2)) (.cse12 (< (+ ~a4~0 ~a12~0) 14)) (.cse13 (< (* 2 |old(~a10~0)|) 0)) (.cse14 (< 23 (+ |old(~a19~0)| ~a4~0))) (.cse38 (+ |old(~a19~0)| |old(~a10~0)|)) (.cse39 (+ ~a4~0 |old(~a10~0)|)) (.cse16 (< 23 .cse41)) (.cse42 (+ ~a12~0 |old(~a10~0)|))) (let ((.cse24 (= 7 |old(~a19~0)|)) (.cse3 (= 10 |old(~a19~0)|)) (.cse27 (and (or .cse16 (< (+ |old(~a1~0)| |old(~a10~0)| 45479) 0) (= 0 |old(~a1~0)|)) (or (< .cse42 2) (< 0 (+ |old(~a1~0)| |old(~a10~0)| 45478))))) (.cse7 (not (= 9 |old(~a19~0)|))) (.cse17 (< 2 .cse42)) (.cse18 (not (= 0 (mod |old(~a10~0)| 2)))) (.cse8 (< 505273 .cse41)) (.cse15 (< 18 .cse39)) (.cse19 (not (= 1 |old(~a10~0)|))) (.cse20 (< 9 .cse38)) (.cse6 (< |old(~a1~0)| (+ |old(~a10~0)| 23))) (.cse30 (< 10 (+ ~inputD~0 ~inputF~0))) (.cse21 (+ |old(~a1~0)| ~a12~0)) (.cse23 (< 28 (* 2 ~a4~0))) (.cse29 (< 10 (* 2 ~inputE~0))) (.cse28 (and (<= ~a1~0 |old(~a1~0)|) (<= |old(~a1~0)| ~a1~0))) (.cse31 (< ~inputF~0 (+ ~a12~0 6))) (.cse32 (< (+ |old(~a19~0)| ~inputE~0) 14)) (.cse33 (< (+ |old(~a19~0)| ~inputC~0) 12)) (.cse34 (< (+ ~a12~0 ~inputB~0) 2)) (.cse35 (< 11 (+ |old(~a19~0)| ~inputB~0))) (.cse36 (< (+ ~a4~0 ~inputD~0) 18)) (.cse37 (< 5 (+ ~inputB~0 ~inputC~0))) (.cse4 (+ ~a1~0 ~a10~0)) (.cse26 (<= ~a1~0 38)) (.cse0 (= 3 |old(~a10~0)|)) (.cse1 (= 4 |old(~a10~0)|)) (.cse25 (< 38 |old(~a1~0)|)) (.cse2 (and (= |old(~a19~0)| ~a19~0) (= |old(~a10~0)| ~a10~0))) (.cse40 (or (< |old(~a19~0)| (+ |old(~a10~0)| 9)) .cse9 .cse22 .cse10 .cse11 .cse12 (< 6217008 (* 2 |old(~a1~0)|)) .cse13 .cse14)) (.cse5 (< (+ |old(~a10~0)| 505271) |old(~a1~0)|))) (and (or .cse0 .cse1 .cse2 .cse3) (or (and (<= (+ ~a10~0 23) ~a1~0) (<= .cse4 505273)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse16 (< (+ |old(~a1~0)| |old(~a10~0)| 56401) 0) (and (<= .cse4 23) (<= 0 (+ ~a1~0 ~a10~0 56401))) .cse7 .cse9 .cse17 .cse10 .cse11 .cse12 .cse18 .cse13 .cse14) (or .cse19 (or .cse20 (< 218 .cse21) (< |old(~a19~0)| (+ ~a12~0 8)) .cse22 .cse23 .cse12) (and (<= 32 (+ ~a1~0 ~a19~0)) (<= ~a1~0 (+ ~a4~0 204)))) (or .cse24 .cse25 .cse26 .cse3) (or .cse27 .cse28 .cse18 .cse29 (< (+ |old(~a1~0)| 56403) ~a12~0) .cse30 .cse31 .cse32 .cse33 (< 4 (+ ~inputB~0 |old(~a10~0)|)) .cse34 .cse35 .cse23 .cse36 .cse10 .cse11 .cse37 .cse13) (or .cse2 .cse24 .cse3) (or (or (and (<= (+ ~a4~0 ~a1~0 45466) 0) (<= ~a4~0 (+ ~a10~0 12))) (and (not (= ~a1~0 0)) (<= 0 (+ ~a1~0 ~a10~0 45479)))) .cse27 .cse7 .cse9 .cse17 .cse10 .cse11 .cse12 .cse18 (< (+ ~a4~0 |old(~a1~0)| 56389) 0) .cse13 .cse14) (or .cse28 .cse6 .cse0 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse8 .cse35 .cse23 .cse36 .cse10 .cse11 .cse37 .cse13 .cse15) (or .cse19 .cse2) (or .cse28 (or .cse20 (< .cse38 9) .cse6 .cse29 (< (+ ~inputE~0 ~inputB~0) 7) .cse30 .cse31 (< ~inputC~0 (+ ~inputB~0 1)) (< 15 .cse39) .cse34 (< (+ |calculate_output_#in~input| 6) |old(~a19~0)|) (< 441469 .cse21) .cse23 .cse36 .cse10 .cse37 .cse13)) (or .cse29 .cse28 .cse31 .cse32 .cse33 .cse34 (< 4 (+ ~inputD~0 |old(~a10~0)|)) .cse35 .cse36 .cse10 .cse11 (< 14 .cse39) (< (+ |old(~a1~0)| ~inputD~0) 27) .cse37 (< 12 (* 2 ~inputF~0)) .cse13 (< (+ ~inputC~0 3108501) |old(~a1~0)|)) (or (and (<= 23 .cse4) (<= ~a1~0 (+ ~a4~0 3108490))) .cse40) (or .cse0 .cse1 .cse25 .cse26) (or .cse0 .cse1 .cse25 .cse2) (or .cse40 (<= ~a1~0 (+ ~a10~0 505271)) .cse5))))) [2018-10-26 22:35:21,217 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-10-26 22:35:21,217 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-10-26 22:35:21,217 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-10-26 22:35:21,217 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,217 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,217 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,217 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,217 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,217 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,217 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-10-26 22:35:21,217 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-10-26 22:35:21,218 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-10-26 22:35:21,218 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-10-26 22:35:21,218 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-10-26 22:35:21,218 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-10-26 22:35:21,218 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-26 22:35:21,218 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 166) no Hoare annotation was computed. [2018-10-26 22:35:21,218 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-10-26 22:35:21,218 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-10-26 22:35:21,218 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-10-26 22:35:21,218 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-10-26 22:35:21,218 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-10-26 22:35:21,218 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-10-26 22:35:21,219 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,219 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,219 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,219 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,219 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,219 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,219 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-10-26 22:35:21,219 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-10-26 22:35:21,219 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-10-26 22:35:21,219 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-10-26 22:35:21,219 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-10-26 22:35:21,219 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-10-26 22:35:21,219 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-10-26 22:35:21,220 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-10-26 22:35:21,220 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-10-26 22:35:21,220 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-10-26 22:35:21,220 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-10-26 22:35:21,220 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-10-26 22:35:21,220 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,220 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,220 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,220 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,220 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,220 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 22:35:21,220 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-10-26 22:35:21,220 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-10-26 22:35:21,220 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-10-26 22:35:21,221 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-10-26 22:35:21,221 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-10-26 22:35:21,221 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-10-26 22:35:21,221 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-10-26 22:35:21,221 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-10-26 22:35:21,221 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-26 22:35:21,221 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-10-26 22:35:21,221 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-10-26 22:35:21,221 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-10-26 22:35:21,221 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 22:35:21,221 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= (+ ~a10~0 14) ~a4~0) (<= (+ ~inputC~0 6) ~a19~0) (<= (+ ~inputB~0 2) ~inputD~0) (<= (+ ~a19~0 ~inputD~0) 13) (<= (+ ~inputF~0 17) ~a1~0) (<= 5 (+ ~a12~0 ~inputE~0)) (<= 2 (+ ~a10~0 ~inputB~0)) (<= (+ ~a12~0 5) ~inputE~0) (<= ~a4~0 (+ ~inputF~0 8)) (<= (+ ~a1~0 ~inputE~0) 28) (<= 6 (+ ~a10~0 ~inputF~0)) (<= (+ ~a10~0 3) ~inputC~0)) [2018-10-26 22:35:21,221 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 22:35:21,221 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 22:35:21,222 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (and (<= (+ ~a12~0 ~a10~0) 0) (<= 9 (+ ~a19~0 ~a10~0)) (= ~a1~0 23) (<= (+ ~a19~0 5) ~a4~0)) (< (+ |old(~a19~0)| ~inputE~0) 14) (< (+ |old(~a1~0)| ~inputF~0) 29) (< (+ |old(~a19~0)| ~inputC~0) 12) (< (+ ~a12~0 ~inputB~0) 2) (< 4 (+ ~inputD~0 |old(~a10~0)|)) (< ~inputD~0 (+ ~a12~0 4)) (< 11 (+ |old(~a19~0)| ~inputB~0)) (< (+ ~a4~0 ~inputD~0) 18) (< 14 (+ ~a4~0 |old(~a10~0)|)) (< 5 (+ ~inputB~0 ~inputC~0)) (< 28 (+ |old(~a1~0)| ~inputE~0)) (< 12 (* 2 ~inputF~0)) (< (* 2 |old(~a10~0)|) 0)) [2018-10-26 22:35:21,222 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-10-26 22:35:21,222 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse0 (not (= ~a19~0 10))) (.cse1 (not (= ~a10~0 3))) (.cse2 (not (= 4 ~a10~0)))) (or (and (not (= 7 ~a19~0)) .cse0) (and .cse1 .cse0 .cse2) (and .cse1 (<= ~a1~0 38) .cse2) (= 1 ~a10~0) (< (+ |old(~a19~0)| ~inputE~0) 14) (< (+ |old(~a1~0)| ~inputF~0) 29) (< (+ |old(~a19~0)| ~inputC~0) 12) (< (+ ~a12~0 ~inputB~0) 2) (< 4 (+ ~inputD~0 |old(~a10~0)|)) (< ~inputD~0 (+ ~a12~0 4)) (< 11 (+ |old(~a19~0)| ~inputB~0)) (< (+ ~a4~0 ~inputD~0) 18) (< 14 (+ ~a4~0 |old(~a10~0)|)) (< 5 (+ ~inputB~0 ~inputC~0)) (< 28 (+ |old(~a1~0)| ~inputE~0)) (< 12 (* 2 ~inputF~0)) (< (* 2 |old(~a10~0)|) 0))) [2018-10-26 22:35:21,222 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-10-26 22:35:21,222 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-10-26 22:35:21,222 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-10-26 22:35:21,222 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse0 (not (= ~a19~0 10))) (.cse1 (not (= ~a10~0 3))) (.cse2 (not (= 4 ~a10~0)))) (or (and (not (= 7 ~a19~0)) .cse0) (and .cse1 .cse0 .cse2) (and .cse1 (<= ~a1~0 38) .cse2) (= 1 ~a10~0) (< (+ |old(~a19~0)| ~inputE~0) 14) (< (+ |old(~a1~0)| ~inputF~0) 29) (< (+ |old(~a19~0)| ~inputC~0) 12) (< (+ ~a12~0 ~inputB~0) 2) (< 4 (+ ~inputD~0 |old(~a10~0)|)) (< ~inputD~0 (+ ~a12~0 4)) (< 11 (+ |old(~a19~0)| ~inputB~0)) (< (+ ~a4~0 ~inputD~0) 18) (< 14 (+ ~a4~0 |old(~a10~0)|)) (< 5 (+ ~inputB~0 ~inputC~0)) (< 28 (+ |old(~a1~0)| ~inputE~0)) (< 12 (* 2 ~inputF~0)) (< (* 2 |old(~a10~0)|) 0))) [2018-10-26 22:35:21,223 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-10-26 22:35:21,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:35:21 BoogieIcfgContainer [2018-10-26 22:35:21,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 22:35:21,232 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 22:35:21,232 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 22:35:21,232 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 22:35:21,233 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:22:24" (3/4) ... [2018-10-26 22:35:21,235 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 22:35:21,240 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 22:35:21,240 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-10-26 22:35:21,240 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 22:35:21,250 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-10-26 22:35:21,251 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-26 22:35:21,282 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(7 == a19) && !(a19 == 10)) || ((!(a10 == 3) && !(a19 == 10)) && !(4 == a10))) || ((!(a10 == 3) && a1 <= 38) && !(4 == a10))) || 1 == a10) || \old(a19) + inputE < 14) || \old(a1) + inputF < 29) || \old(a19) + inputC < 12) || a12 + inputB < 2) || 4 < inputD + \old(a10)) || inputD < a12 + 4) || 11 < \old(a19) + inputB) || a4 + inputD < 18) || 14 < a4 + \old(a10)) || 5 < inputB + inputC) || 28 < \old(a1) + inputE) || 12 < 2 * inputF) || 2 * \old(a10) < 0 [2018-10-26 22:35:21,395 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5359a85b-b42b-4a2b-bbe3-9859349632d6/bin-2019/utaipan/witness.graphml [2018-10-26 22:35:21,395 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 22:35:21,396 INFO L168 Benchmark]: Toolchain (without parser) took 780845.52 ms. Allocated memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: 4.3 GB). Free memory was 951.8 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-10-26 22:35:21,397 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:35:21,397 INFO L168 Benchmark]: CACSL2BoogieTranslator took 554.15 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 924.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-10-26 22:35:21,397 INFO L168 Benchmark]: Boogie Procedure Inliner took 208.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 924.9 MB in the beginning and 1.2 GB in the end (delta: -228.6 MB). Peak memory consumption was 35.3 MB. Max. memory is 11.5 GB. [2018-10-26 22:35:21,397 INFO L168 Benchmark]: Boogie Preprocessor took 81.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-10-26 22:35:21,397 INFO L168 Benchmark]: RCFGBuilder took 2687.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 101.2 MB). Peak memory consumption was 101.2 MB. Max. memory is 11.5 GB. [2018-10-26 22:35:21,398 INFO L168 Benchmark]: TraceAbstraction took 777144.81 ms. Allocated memory was 1.2 GB in the beginning and 5.3 GB in the end (delta: 4.1 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 5.1 GB. Max. memory is 11.5 GB. [2018-10-26 22:35:21,398 INFO L168 Benchmark]: Witness Printer took 162.81 ms. Allocated memory is still 5.3 GB. Free memory was 3.2 GB in the beginning and 3.1 GB in the end (delta: 74.8 MB). Peak memory consumption was 74.8 MB. Max. memory is 11.5 GB. [2018-10-26 22:35:21,403 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 554.15 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 924.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 208.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 924.9 MB in the beginning and 1.2 GB in the end (delta: -228.6 MB). Peak memory consumption was 35.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2687.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 101.2 MB). Peak memory consumption was 101.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 777144.81 ms. Allocated memory was 1.2 GB in the beginning and 5.3 GB in the end (delta: 4.1 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 5.1 GB. Max. memory is 11.5 GB. * Witness Printer took 162.81 ms. Allocated memory is still 5.3 GB. Free memory was 3.2 GB in the beginning and 3.1 GB in the end (delta: 74.8 MB). Peak memory consumption was 74.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 166]: 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: 582]: Loop Invariant Derived loop invariant: ((((((((((((((((!(7 == a19) && !(a19 == 10)) || ((!(a10 == 3) && !(a19 == 10)) && !(4 == a10))) || ((!(a10 == 3) && a1 <= 38) && !(4 == a10))) || 1 == a10) || \old(a19) + inputE < 14) || \old(a1) + inputF < 29) || \old(a19) + inputC < 12) || a12 + inputB < 2) || 4 < inputD + \old(a10)) || inputD < a12 + 4) || 11 < \old(a19) + inputB) || a4 + inputD < 18) || 14 < a4 + \old(a10)) || 5 < inputB + inputC) || 28 < \old(a1) + inputE) || 12 < 2 * inputF) || 2 * \old(a10) < 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 777.0s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 497.1s AutomataDifference, 0.0s DeadEndRemovalTime, 165.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1618 SDtfs, 11498 SDslu, 1942 SDs, 0 SdLazy, 15267 SolverSat, 2002 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 242.0s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 1485 GetRequests, 1196 SyntacticMatches, 116 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1701 ImplicationChecksByTransitivity, 74.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5185occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 39.3s AbstIntTime, 5 AbstIntIterations, 5 AbstIntStrong, 0.9956684402187026 AbsIntWeakeningRatio, 0.09847936278059377 AbsIntAvgWeakeningVarsNumRemoved, 520.1049963794352 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 449 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 159 PreInvPairs, 239 NumberOfFragments, 1404 HoareAnnotationTreeSize, 159 FomulaSimplifications, 121935 FormulaSimplificationTreeSizeReduction, 53.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 199158 FormulaSimplificationTreeSizeReductionInter, 111.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2338 NumberOfCodeBlocks, 2338 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2327 ConstructedInterpolants, 0 QuantifiedInterpolants, 2553176 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 1197/1629 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...