./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label25_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_ed34ba2a-81fd-4d24-8c63-f1e244dd87d3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ed34ba2a-81fd-4d24-8c63-f1e244dd87d3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ed34ba2a-81fd-4d24-8c63-f1e244dd87d3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ed34ba2a-81fd-4d24-8c63-f1e244dd87d3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label25_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ed34ba2a-81fd-4d24-8c63-f1e244dd87d3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ed34ba2a-81fd-4d24-8c63-f1e244dd87d3/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 23f7450b399d10b1ac0a8f247ff41c3f7806d83a ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 09:18:35,544 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:18:35,545 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:18:35,551 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:18:35,551 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:18:35,551 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:18:35,552 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:18:35,553 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:18:35,554 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:18:35,554 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:18:35,555 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:18:35,555 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:18:35,555 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:18:35,556 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:18:35,557 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:18:35,557 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:18:35,558 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:18:35,558 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:18:35,560 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:18:35,560 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:18:35,561 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:18:35,562 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:18:35,563 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:18:35,564 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:18:35,564 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:18:35,564 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:18:35,565 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:18:35,565 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:18:35,566 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:18:35,566 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:18:35,567 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:18:35,567 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:18:35,567 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:18:35,567 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:18:35,568 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:18:35,569 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:18:35,569 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ed34ba2a-81fd-4d24-8c63-f1e244dd87d3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 09:18:35,579 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:18:35,579 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:18:35,580 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 09:18:35,580 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 09:18:35,580 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 09:18:35,580 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 09:18:35,580 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 09:18:35,580 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 09:18:35,580 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 09:18:35,580 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 09:18:35,581 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 09:18:35,581 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:18:35,581 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 09:18:35,581 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:18:35,581 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 09:18:35,582 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:18:35,582 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 09:18:35,582 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 09:18:35,582 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 09:18:35,582 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 09:18:35,582 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:18:35,582 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 09:18:35,583 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:18:35,583 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:18:35,583 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 09:18:35,583 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 09:18:35,583 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 09:18:35,583 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:18:35,583 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 09:18:35,583 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 09:18:35,584 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 09:18:35,584 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 09:18:35,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 09:18:35,584 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 09:18:35,584 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_ed34ba2a-81fd-4d24-8c63-f1e244dd87d3/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 -> 23f7450b399d10b1ac0a8f247ff41c3f7806d83a [2018-11-10 09:18:35,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:18:35,617 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:18:35,619 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:18:35,621 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:18:35,621 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:18:35,621 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ed34ba2a-81fd-4d24-8c63-f1e244dd87d3/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label25_true-unreach-call.c [2018-11-10 09:18:35,665 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ed34ba2a-81fd-4d24-8c63-f1e244dd87d3/bin-2019/utaipan/data/5dbdafc65/ab9e3bf4fd0e483988d0610fbe3fbb6b/FLAG08bbddde5 [2018-11-10 09:18:36,130 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:18:36,131 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ed34ba2a-81fd-4d24-8c63-f1e244dd87d3/sv-benchmarks/c/eca-rers2012/Problem10_label25_true-unreach-call.c [2018-11-10 09:18:36,141 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ed34ba2a-81fd-4d24-8c63-f1e244dd87d3/bin-2019/utaipan/data/5dbdafc65/ab9e3bf4fd0e483988d0610fbe3fbb6b/FLAG08bbddde5 [2018-11-10 09:18:36,151 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ed34ba2a-81fd-4d24-8c63-f1e244dd87d3/bin-2019/utaipan/data/5dbdafc65/ab9e3bf4fd0e483988d0610fbe3fbb6b [2018-11-10 09:18:36,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:18:36,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:18:36,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:18:36,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:18:36,157 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:18:36,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:18:36" (1/1) ... [2018-11-10 09:18:36,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@372d3e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:18:36, skipping insertion in model container [2018-11-10 09:18:36,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:18:36" (1/1) ... [2018-11-10 09:18:36,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:18:36,200 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:18:36,424 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:18:36,426 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:18:36,495 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:18:36,504 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:18:36,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:18:36 WrapperNode [2018-11-10 09:18:36,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:18:36,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:18:36,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:18:36,505 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:18:36,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:18:36" (1/1) ... [2018-11-10 09:18:36,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:18:36" (1/1) ... [2018-11-10 09:18:36,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:18:36,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:18:36,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:18:36,623 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:18:36,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:18:36" (1/1) ... [2018-11-10 09:18:36,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:18:36" (1/1) ... [2018-11-10 09:18:36,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:18:36" (1/1) ... [2018-11-10 09:18:36,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:18:36" (1/1) ... [2018-11-10 09:18:36,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:18:36" (1/1) ... [2018-11-10 09:18:36,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:18:36" (1/1) ... [2018-11-10 09:18:36,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:18:36" (1/1) ... [2018-11-10 09:18:36,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:18:36,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:18:36,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:18:36,672 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:18:36,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:18:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed34ba2a-81fd-4d24-8c63-f1e244dd87d3/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 09:18:36,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 09:18:36,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 09:18:36,713 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-10 09:18:36,713 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-10 09:18:36,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:18:36,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:18:36,713 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 09:18:36,713 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 09:18:37,566 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:18:37,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:18:37 BoogieIcfgContainer [2018-11-10 09:18:37,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:18:37,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 09:18:37,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 09:18:37,570 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 09:18:37,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:18:36" (1/3) ... [2018-11-10 09:18:37,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45738f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:18:37, skipping insertion in model container [2018-11-10 09:18:37,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:18:36" (2/3) ... [2018-11-10 09:18:37,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45738f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:18:37, skipping insertion in model container [2018-11-10 09:18:37,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:18:37" (3/3) ... [2018-11-10 09:18:37,572 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label25_true-unreach-call.c [2018-11-10 09:18:37,578 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 09:18:37,588 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 09:18:37,597 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 09:18:37,619 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 09:18:37,620 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 09:18:37,620 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 09:18:37,620 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:18:37,620 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:18:37,620 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 09:18:37,620 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:18:37,620 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 09:18:37,636 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-10 09:18:37,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 09:18:37,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:18:37,642 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:18:37,644 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:18:37,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:18:37,648 INFO L82 PathProgramCache]: Analyzing trace with hash 382760497, now seen corresponding path program 1 times [2018-11-10 09:18:37,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:18:37,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:18:37,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:18:37,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:18:37,679 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:18:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:18:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:18:37,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:18:37,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:18:37,876 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:18:37,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:18:37,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:18:37,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:18:37,889 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-10 09:18:38,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:18:38,506 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-10 09:18:38,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:18:38,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-11-10 09:18:38,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:18:38,519 INFO L225 Difference]: With dead ends: 574 [2018-11-10 09:18:38,519 INFO L226 Difference]: Without dead ends: 356 [2018-11-10 09:18:38,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:18:38,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-10 09:18:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-10 09:18:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-10 09:18:38,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 592 transitions. [2018-11-10 09:18:38,568 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 592 transitions. Word has length 71 [2018-11-10 09:18:38,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:18:38,569 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 592 transitions. [2018-11-10 09:18:38,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:18:38,569 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 592 transitions. [2018-11-10 09:18:38,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 09:18:38,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:18:38,574 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, 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] [2018-11-10 09:18:38,575 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:18:38,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:18:38,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1446129720, now seen corresponding path program 1 times [2018-11-10 09:18:38,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:18:38,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:18:38,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:18:38,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:18:38,577 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:18:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:18:38,732 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:18:38,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:18:38,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 09:18:38,733 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:18:38,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 09:18:38,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 09:18:38,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:18:38,734 INFO L87 Difference]: Start difference. First operand 356 states and 592 transitions. Second operand 6 states. [2018-11-10 09:18:39,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:18:39,559 INFO L93 Difference]: Finished difference Result 1002 states and 1689 transitions. [2018-11-10 09:18:39,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 09:18:39,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2018-11-10 09:18:39,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:18:39,565 INFO L225 Difference]: With dead ends: 1002 [2018-11-10 09:18:39,565 INFO L226 Difference]: Without dead ends: 652 [2018-11-10 09:18:39,567 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-11-10 09:18:39,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-11-10 09:18:39,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 640. [2018-11-10 09:18:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-11-10 09:18:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 960 transitions. [2018-11-10 09:18:39,594 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 960 transitions. Word has length 141 [2018-11-10 09:18:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:18:39,594 INFO L481 AbstractCegarLoop]: Abstraction has 640 states and 960 transitions. [2018-11-10 09:18:39,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 09:18:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 960 transitions. [2018-11-10 09:18:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-10 09:18:39,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:18:39,598 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, 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] [2018-11-10 09:18:39,598 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:18:39,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:18:39,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1467562684, now seen corresponding path program 1 times [2018-11-10 09:18:39,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:18:39,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:18:39,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:18:39,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:18:39,600 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:18:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:18:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:18:39,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:18:39,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:18:39,709 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:18:39,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 09:18:39,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:18:39,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:18:39,710 INFO L87 Difference]: Start difference. First operand 640 states and 960 transitions. Second operand 4 states. [2018-11-10 09:18:40,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:18:40,415 INFO L93 Difference]: Finished difference Result 2128 states and 3336 transitions. [2018-11-10 09:18:40,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:18:40,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-11-10 09:18:40,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:18:40,422 INFO L225 Difference]: With dead ends: 2128 [2018-11-10 09:18:40,422 INFO L226 Difference]: Without dead ends: 904 [2018-11-10 09:18:40,427 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-11-10 09:18:40,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-11-10 09:18:40,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2018-11-10 09:18:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-11-10 09:18:40,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1277 transitions. [2018-11-10 09:18:40,449 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1277 transitions. Word has length 151 [2018-11-10 09:18:40,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:18:40,449 INFO L481 AbstractCegarLoop]: Abstraction has 904 states and 1277 transitions. [2018-11-10 09:18:40,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 09:18:40,449 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1277 transitions. [2018-11-10 09:18:40,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 09:18:40,452 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:18:40,453 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:18:40,453 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:18:40,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:18:40,453 INFO L82 PathProgramCache]: Analyzing trace with hash -774507349, now seen corresponding path program 1 times [2018-11-10 09:18:40,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:18:40,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:18:40,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:18:40,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:18:40,454 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:18:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:18:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:18:40,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:18:40,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 09:18:40,597 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:18:40,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 09:18:40,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 09:18:40,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:18:40,598 INFO L87 Difference]: Start difference. First operand 904 states and 1277 transitions. Second operand 6 states. [2018-11-10 09:18:41,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:18:41,193 INFO L93 Difference]: Finished difference Result 2127 states and 3078 transitions. [2018-11-10 09:18:41,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 09:18:41,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 194 [2018-11-10 09:18:41,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:18:41,198 INFO L225 Difference]: With dead ends: 2127 [2018-11-10 09:18:41,198 INFO L226 Difference]: Without dead ends: 1229 [2018-11-10 09:18:41,200 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-11-10 09:18:41,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-11-10 09:18:41,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1208. [2018-11-10 09:18:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2018-11-10 09:18:41,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1646 transitions. [2018-11-10 09:18:41,227 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1646 transitions. Word has length 194 [2018-11-10 09:18:41,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:18:41,228 INFO L481 AbstractCegarLoop]: Abstraction has 1208 states and 1646 transitions. [2018-11-10 09:18:41,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 09:18:41,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1646 transitions. [2018-11-10 09:18:41,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-10 09:18:41,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:18:41,231 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:18:41,231 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:18:41,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:18:41,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1703489504, now seen corresponding path program 1 times [2018-11-10 09:18:41,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:18:41,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:18:41,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:18:41,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:18:41,233 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:18:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:18:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 128 proven. 78 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 09:18:41,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:18:41,359 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:18:41,360 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-11-10 09:18:41,361 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], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 09:18:41,402 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:18:41,403 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:18:42,960 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 09:18:42,961 INFO L272 AbstractInterpreter]: Visited 93 different actions 93 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-10 09:18:42,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:18:42,966 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 09:18:45,319 INFO L227 lantSequenceWeakener]: Weakened 221 states. On average, predicates are now at 74.05% of their original sizes. [2018-11-10 09:18:45,319 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 09:18:47,992 INFO L415 sIntCurrentIteration]: We unified 241 AI predicates to 241 [2018-11-10 09:18:47,992 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 09:18:47,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 09:18:47,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-10 09:18:47,993 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:18:47,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 09:18:47,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 09:18:47,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 09:18:47,994 INFO L87 Difference]: Start difference. First operand 1208 states and 1646 transitions. Second operand 10 states. [2018-11-10 09:18:54,999 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:19:13,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:19:13,131 INFO L93 Difference]: Finished difference Result 2559 states and 3488 transitions. [2018-11-10 09:19:13,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 09:19:13,131 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 242 [2018-11-10 09:19:13,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:19:13,134 INFO L225 Difference]: With dead ends: 2559 [2018-11-10 09:19:13,134 INFO L226 Difference]: Without dead ends: 1357 [2018-11-10 09:19:13,137 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 245 GetRequests, 204 SyntacticMatches, 29 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-11-10 09:19:13,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2018-11-10 09:19:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1352. [2018-11-10 09:19:13,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-11-10 09:19:13,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1796 transitions. [2018-11-10 09:19:13,176 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1796 transitions. Word has length 242 [2018-11-10 09:19:13,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:19:13,176 INFO L481 AbstractCegarLoop]: Abstraction has 1352 states and 1796 transitions. [2018-11-10 09:19:13,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 09:19:13,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1796 transitions. [2018-11-10 09:19:13,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-10 09:19:13,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:19:13,180 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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-11-10 09:19:13,180 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:19:13,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:13,181 INFO L82 PathProgramCache]: Analyzing trace with hash -677086258, now seen corresponding path program 1 times [2018-11-10 09:19:13,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:19:13,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:13,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:19:13,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:19:13,182 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:19:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:19:13,718 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 266 proven. 82 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 09:19:13,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:19:13,718 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:19:13,718 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 314 with the following transitions: [2018-11-10 09:19:13,719 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], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 09:19:13,722 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:19:13,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:19:14,477 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:19:20,448 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 09:19:20,449 INFO L272 AbstractInterpreter]: Visited 97 different actions 461 times. Merged at 5 different actions 20 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 09:19:20,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:19:20,453 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 09:19:22,001 INFO L227 lantSequenceWeakener]: Weakened 100 states. On average, predicates are now at 75.77% of their original sizes. [2018-11-10 09:19:22,001 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 09:19:31,282 INFO L415 sIntCurrentIteration]: We unified 312 AI predicates to 312 [2018-11-10 09:19:31,282 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 09:19:31,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 09:19:31,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [14] total 32 [2018-11-10 09:19:31,282 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:19:31,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 09:19:31,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 09:19:31,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-11-10 09:19:31,283 INFO L87 Difference]: Start difference. First operand 1352 states and 1796 transitions. Second operand 20 states. [2018-11-10 09:21:06,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:06,430 INFO L93 Difference]: Finished difference Result 3018 states and 4059 transitions. [2018-11-10 09:21:06,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 09:21:06,430 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 313 [2018-11-10 09:21:06,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:21:06,435 INFO L225 Difference]: With dead ends: 3018 [2018-11-10 09:21:06,435 INFO L226 Difference]: Without dead ends: 1816 [2018-11-10 09:21:06,437 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 323 GetRequests, 272 SyntacticMatches, 22 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2018-11-10 09:21:06,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2018-11-10 09:21:06,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1730. [2018-11-10 09:21:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1730 states. [2018-11-10 09:21:06,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2217 transitions. [2018-11-10 09:21:06,502 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2217 transitions. Word has length 313 [2018-11-10 09:21:06,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:21:06,502 INFO L481 AbstractCegarLoop]: Abstraction has 1730 states and 2217 transitions. [2018-11-10 09:21:06,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 09:21:06,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2217 transitions. [2018-11-10 09:21:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-11-10 09:21:06,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:21:06,508 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:06,508 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:21:06,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:06,508 INFO L82 PathProgramCache]: Analyzing trace with hash 765572205, now seen corresponding path program 1 times [2018-11-10 09:21:06,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:21:06,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:06,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:06,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:06,509 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:21:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 283 proven. 158 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 09:21:06,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:06,908 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:21:06,908 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 359 with the following transitions: [2018-11-10 09:21:06,908 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], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [547], [551], [555], [559], [563], [566], [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], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 09:21:06,912 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:21:06,912 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:21:08,640 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:21:35,764 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:21:35,764 INFO L272 AbstractInterpreter]: Visited 126 different actions 740 times. Merged at 8 different actions 43 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-10 09:21:35,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:35,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:21:35,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:35,768 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed34ba2a-81fd-4d24-8c63-f1e244dd87d3/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:21:35,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:35,774 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:21:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:35,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 377 proven. 4 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-10 09:21:36,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:21:36,776 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 09:21:36,818 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 26 [2018-11-10 09:21:36,990 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2018-11-10 09:21:36,992 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,029 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,090 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,162 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,214 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,254 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,292 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,331 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,374 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,426 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,483 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,527 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,563 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,603 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,639 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,677 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,731 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,766 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,800 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,842 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,878 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,931 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:37,995 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,043 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,086 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,133 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,169 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,210 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,246 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,279 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,313 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,350 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,398 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,446 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,494 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,528 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,564 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,600 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,637 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,680 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,720 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,755 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,790 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,824 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,859 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,896 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,931 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:38,967 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,002 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,036 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,070 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,112 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,147 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,197 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,231 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,279 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,325 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,367 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,402 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,437 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,482 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,518 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,552 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,586 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,625 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,658 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,691 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,725 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,757 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,794 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,828 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,864 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,898 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,931 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:39,966 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,004 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,073 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,107 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,148 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,182 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,215 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,246 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,280 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,328 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,373 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,408 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,443 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,483 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,524 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,559 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,604 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,647 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,692 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,727 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,776 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,820 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,854 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,888 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,923 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,958 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:40,999 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:41,033 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:41,065 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:41,098 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:41,132 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:41,165 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:41,198 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:41,230 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:21:41,662 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 202 proven. 239 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 09:21:41,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:21:41,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2018-11-10 09:21:41,679 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:21:41,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 09:21:41,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 09:21:41,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2018-11-10 09:21:41,680 INFO L87 Difference]: Start difference. First operand 1730 states and 2217 transitions. Second operand 18 states. [2018-11-10 09:21:43,776 WARN L179 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 68 DAG size of output: 37 [2018-11-10 09:22:13,888 WARN L179 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2018-11-10 09:22:23,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:22:23,445 INFO L93 Difference]: Finished difference Result 6665 states and 9378 transitions. [2018-11-10 09:22:23,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-10 09:22:23,445 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 358 [2018-11-10 09:22:23,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:22:23,457 INFO L225 Difference]: With dead ends: 6665 [2018-11-10 09:22:23,458 INFO L226 Difference]: Without dead ends: 5236 [2018-11-10 09:22:23,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 629 SyntacticMatches, 111 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3457 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=824, Invalid=2958, Unknown=0, NotChecked=0, Total=3782 [2018-11-10 09:22:23,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5236 states. [2018-11-10 09:22:23,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5236 to 5016. [2018-11-10 09:22:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5016 states. [2018-11-10 09:22:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5016 states to 5016 states and 6561 transitions. [2018-11-10 09:22:23,598 INFO L78 Accepts]: Start accepts. Automaton has 5016 states and 6561 transitions. Word has length 358 [2018-11-10 09:22:23,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:22:23,599 INFO L481 AbstractCegarLoop]: Abstraction has 5016 states and 6561 transitions. [2018-11-10 09:22:23,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 09:22:23,599 INFO L276 IsEmpty]: Start isEmpty. Operand 5016 states and 6561 transitions. [2018-11-10 09:22:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-11-10 09:22:23,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:22:23,609 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:22:23,609 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:22:23,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:22:23,610 INFO L82 PathProgramCache]: Analyzing trace with hash 651085646, now seen corresponding path program 1 times [2018-11-10 09:22:23,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:22:23,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:22:23,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:22:23,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:22:23,611 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:22:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:22:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-11-10 09:22:23,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:22:23,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:22:23,774 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:22:23,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 09:22:23,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:22:23,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:22:23,775 INFO L87 Difference]: Start difference. First operand 5016 states and 6561 transitions. Second operand 4 states. [2018-11-10 09:22:24,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:22:24,558 INFO L93 Difference]: Finished difference Result 12417 states and 17065 transitions. [2018-11-10 09:22:24,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:22:24,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 377 [2018-11-10 09:22:24,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:22:24,575 INFO L225 Difference]: With dead ends: 12417 [2018-11-10 09:22:24,575 INFO L226 Difference]: Without dead ends: 7777 [2018-11-10 09:22:24,584 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-11-10 09:22:24,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7777 states. [2018-11-10 09:22:24,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7777 to 7765. [2018-11-10 09:22:24,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7765 states. [2018-11-10 09:22:24,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7765 states to 7765 states and 10243 transitions. [2018-11-10 09:22:24,723 INFO L78 Accepts]: Start accepts. Automaton has 7765 states and 10243 transitions. Word has length 377 [2018-11-10 09:22:24,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:22:24,724 INFO L481 AbstractCegarLoop]: Abstraction has 7765 states and 10243 transitions. [2018-11-10 09:22:24,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 09:22:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand 7765 states and 10243 transitions. [2018-11-10 09:22:24,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-11-10 09:22:24,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:22:24,738 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:22:24,739 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:22:24,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:22:24,739 INFO L82 PathProgramCache]: Analyzing trace with hash -268100511, now seen corresponding path program 1 times [2018-11-10 09:22:24,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:22:24,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:22:24,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:22:24,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:22:24,740 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:22:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:22:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 269 proven. 89 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-11-10 09:22:24,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:22:24,989 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:22:24,989 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 397 with the following transitions: [2018-11-10 09:22:24,989 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], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [558], [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], [703], [706], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 09:22:24,992 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:22:24,993 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:22:26,731 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:22:34,989 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 09:22:34,989 INFO L272 AbstractInterpreter]: Visited 132 different actions 515 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 09:22:34,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:22:34,991 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 09:22:37,013 INFO L227 lantSequenceWeakener]: Weakened 101 states. On average, predicates are now at 75.76% of their original sizes. [2018-11-10 09:22:37,014 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 09:23:06,667 INFO L415 sIntCurrentIteration]: We unified 395 AI predicates to 395 [2018-11-10 09:23:06,667 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 09:23:06,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 09:23:06,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [8] total 29 [2018-11-10 09:23:06,667 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:23:06,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 09:23:06,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 09:23:06,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2018-11-10 09:23:06,668 INFO L87 Difference]: Start difference. First operand 7765 states and 10243 transitions. Second operand 23 states. [2018-11-10 09:24:51,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:24:51,473 INFO L93 Difference]: Finished difference Result 16361 states and 21823 transitions. [2018-11-10 09:24:51,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-10 09:24:51,473 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 396 [2018-11-10 09:24:51,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:24:51,500 INFO L225 Difference]: With dead ends: 16361 [2018-11-10 09:24:51,500 INFO L226 Difference]: Without dead ends: 8972 [2018-11-10 09:24:51,515 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 415 GetRequests, 322 SyntacticMatches, 52 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=316, Invalid=1490, Unknown=0, NotChecked=0, Total=1806 [2018-11-10 09:24:51,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8972 states. [2018-11-10 09:24:51,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8972 to 8941. [2018-11-10 09:24:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8941 states. [2018-11-10 09:24:51,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8941 states to 8941 states and 11666 transitions. [2018-11-10 09:24:51,926 INFO L78 Accepts]: Start accepts. Automaton has 8941 states and 11666 transitions. Word has length 396 [2018-11-10 09:24:51,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:24:51,926 INFO L481 AbstractCegarLoop]: Abstraction has 8941 states and 11666 transitions. [2018-11-10 09:24:51,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 09:24:51,927 INFO L276 IsEmpty]: Start isEmpty. Operand 8941 states and 11666 transitions. [2018-11-10 09:24:51,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-11-10 09:24:51,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:24:51,948 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:24:51,948 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:24:51,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:24:51,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1851065428, now seen corresponding path program 1 times [2018-11-10 09:24:51,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:24:51,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:24:51,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:24:51,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:24:51,949 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:24:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:24:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 256 proven. 76 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-11-10 09:24:52,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:24:52,271 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:24:52,271 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 406 with the following transitions: [2018-11-10 09:24:52,271 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], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [506], [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], [679], [683], [687], [691], [695], [699], [703], [706], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [766], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 09:24:52,274 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:24:52,274 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:24:53,408 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:25:00,952 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 09:25:00,953 INFO L272 AbstractInterpreter]: Visited 147 different actions 428 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 09:25:00,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:00,959 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 09:25:04,326 INFO L227 lantSequenceWeakener]: Weakened 136 states. On average, predicates are now at 74.88% of their original sizes. [2018-11-10 09:25:04,326 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 09:25:19,149 INFO L415 sIntCurrentIteration]: We unified 404 AI predicates to 404 [2018-11-10 09:25:19,149 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 09:25:19,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 09:25:19,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [8] total 25 [2018-11-10 09:25:19,150 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:25:19,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 09:25:19,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 09:25:19,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-10 09:25:19,151 INFO L87 Difference]: Start difference. First operand 8941 states and 11666 transitions. Second operand 19 states. [2018-11-10 09:26:39,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:26:39,682 INFO L93 Difference]: Finished difference Result 17954 states and 23465 transitions. [2018-11-10 09:26:39,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 09:26:39,682 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 405 [2018-11-10 09:26:39,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:26:39,698 INFO L225 Difference]: With dead ends: 17954 [2018-11-10 09:26:39,698 INFO L226 Difference]: Without dead ends: 9389 [2018-11-10 09:26:39,705 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 414 GetRequests, 373 SyntacticMatches, 14 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2018-11-10 09:26:39,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9389 states. [2018-11-10 09:26:40,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9389 to 9381. [2018-11-10 09:26:40,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9381 states. [2018-11-10 09:26:40,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9381 states to 9381 states and 12152 transitions. [2018-11-10 09:26:40,059 INFO L78 Accepts]: Start accepts. Automaton has 9381 states and 12152 transitions. Word has length 405 [2018-11-10 09:26:40,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:26:40,060 INFO L481 AbstractCegarLoop]: Abstraction has 9381 states and 12152 transitions. [2018-11-10 09:26:40,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 09:26:40,060 INFO L276 IsEmpty]: Start isEmpty. Operand 9381 states and 12152 transitions. [2018-11-10 09:26:40,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-11-10 09:26:40,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:26:40,072 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-10 09:26:40,072 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:26:40,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:26:40,072 INFO L82 PathProgramCache]: Analyzing trace with hash 642099933, now seen corresponding path program 1 times [2018-11-10 09:26:40,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:26:40,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:26:40,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:26:40,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:26:40,073 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:26:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:26:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 182 proven. 222 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-10 09:26:40,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:26:40,392 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:26:40,393 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 415 with the following transitions: [2018-11-10 09:26:40,393 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], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [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], [703], [706], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [766], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 09:26:40,395 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:26:40,395 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:26:41,474 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:27:01,661 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:27:01,662 INFO L272 AbstractInterpreter]: Visited 148 different actions 874 times. Merged at 8 different actions 46 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-10 09:27:01,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:27:01,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:27:01,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:27:01,663 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed34ba2a-81fd-4d24-8c63-f1e244dd87d3/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:27:01,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:27:01,668 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:27:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:27:01,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:27:04,161 WARN L179 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2018-11-10 09:27:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 0 proven. 479 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:27:05,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:27:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-11-10 09:27:05,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:27:05,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12, 12] total 19 [2018-11-10 09:27:05,948 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:27:05,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:27:05,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:27:05,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=281, Unknown=1, NotChecked=0, Total=342 [2018-11-10 09:27:05,948 INFO L87 Difference]: Start difference. First operand 9381 states and 12152 transitions. Second operand 3 states. [2018-11-10 09:27:06,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:27:06,608 INFO L93 Difference]: Finished difference Result 18193 states and 23978 transitions. [2018-11-10 09:27:06,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:27:06,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 414 [2018-11-10 09:27:06,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:27:06,608 INFO L225 Difference]: With dead ends: 18193 [2018-11-10 09:27:06,608 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 09:27:06,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 820 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=60, Invalid=281, Unknown=1, NotChecked=0, Total=342 [2018-11-10 09:27:06,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 09:27:06,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 09:27:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 09:27:06,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 09:27:06,636 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 414 [2018-11-10 09:27:06,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:27:06,636 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:27:06,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:27:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 09:27:06,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 09:27:06,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 09:27:06,757 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 362 [2018-11-10 09:27:07,579 WARN L179 SmtUtils]: Spent 819.00 ms on a formula simplification that was a NOOP. DAG size: 1186 [2018-11-10 09:27:10,509 WARN L179 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 1638 DAG size of output: 1638 [2018-11-10 09:27:14,433 WARN L179 SmtUtils]: Spent 3.92 s on a formula simplification. DAG size of input: 1996 DAG size of output: 1996 [2018-11-10 09:27:16,668 WARN L179 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 1475 DAG size of output: 1475 [2018-11-10 09:27:17,674 WARN L179 SmtUtils]: Spent 978.00 ms on a formula simplification. DAG size of input: 1458 DAG size of output: 1458 [2018-11-10 09:27:18,589 WARN L179 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 1406 DAG size of output: 1406 [2018-11-10 09:27:22,515 WARN L179 SmtUtils]: Spent 3.92 s on a formula simplification. DAG size of input: 1996 DAG size of output: 1996 [2018-11-10 09:27:23,349 WARN L179 SmtUtils]: Spent 820.00 ms on a formula simplification that was a NOOP. DAG size: 1378 [2018-11-10 09:27:24,290 WARN L179 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 1412 DAG size of output: 1412 [2018-11-10 09:27:34,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:27:45,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:28:04,987 WARN L179 SmtUtils]: Spent 40.66 s on a formula simplification. DAG size of input: 2721 DAG size of output: 2708 [2018-11-10 09:28:05,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:28:47,557 WARN L179 SmtUtils]: Spent 42.56 s on a formula simplification. DAG size of input: 2703 DAG size of output: 2692 [2018-11-10 09:28:48,154 WARN L179 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 44 [2018-11-10 09:28:59,258 WARN L179 SmtUtils]: Spent 11.10 s on a formula simplification. DAG size of input: 924 DAG size of output: 73 [2018-11-10 09:29:20,106 WARN L179 SmtUtils]: Spent 20.80 s on a formula simplification. DAG size of input: 2002 DAG size of output: 44 [2018-11-10 09:30:25,055 WARN L179 SmtUtils]: Spent 1.08 m on a formula simplification. DAG size of input: 2129 DAG size of output: 83 [2018-11-10 09:30:51,374 WARN L179 SmtUtils]: Spent 26.30 s on a formula simplification. DAG size of input: 2114 DAG size of output: 83 [2018-11-10 09:30:51,375 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 09:30:51,376 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a19~0 |old(~a19~0)|) (= |old(~a10~0)| ~a10~0) (= ~a1~0 |old(~a1~0)|)) [2018-11-10 09:30:51,376 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:30:51,376 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-11-10 09:30:51,376 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,376 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,376 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,376 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,376 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,376 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,376 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-11-10 09:30:51,376 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-11-10 09:30:51,376 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-10 09:30:51,377 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-10 09:30:51,377 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-10 09:30:51,377 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-10 09:30:51,377 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-10 09:30:51,377 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-10 09:30:51,377 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-11-10 09:30:51,377 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-11-10 09:30:51,377 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-11-10 09:30:51,377 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,377 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,377 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,377 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,377 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,377 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-11-10 09:30:51,377 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-11-10 09:30:51,378 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-11-10 09:30:51,378 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-11-10 09:30:51,378 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-10 09:30:51,378 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-10 09:30:51,378 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-10 09:30:51,378 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-10 09:30:51,378 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-10 09:30:51,378 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-11-10 09:30:51,378 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-11-10 09:30:51,378 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-11-10 09:30:51,378 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-11-10 09:30:51,378 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-11-10 09:30:51,378 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,378 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,378 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,379 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,379 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,379 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-11-10 09:30:51,379 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-10 09:30:51,379 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-10 09:30:51,379 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-10 09:30:51,379 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-10 09:30:51,379 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-10 09:30:51,379 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 196) no Hoare annotation was computed. [2018-11-10 09:30:51,379 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-11-10 09:30:51,379 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-11-10 09:30:51,379 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-11-10 09:30:51,379 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-11-10 09:30:51,379 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,379 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,379 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,379 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,379 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-10 09:30:51,380 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-11-10 09:30:51,381 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-11-10 09:30:51,382 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-11-10 09:30:51,383 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-11-10 09:30:51,383 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-10 09:30:51,383 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-10 09:30:51,383 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-10 09:30:51,383 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-10 09:30:51,383 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-10 09:30:51,383 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-10 09:30:51,383 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-11-10 09:30:51,383 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-11-10 09:30:51,383 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse5 (= |old(~a10~0)| ~a10~0))) (let ((.cse1 (= 7 |old(~a19~0)|)) (.cse4 (= 4 |old(~a10~0)|)) (.cse2 (not (= 14 ~a4~0))) (.cse3 (not (= 0 ~a12~0))) (.cse0 (and (= ~a19~0 |old(~a19~0)|) .cse5 (= ~a1~0 |old(~a1~0)|)))) (and (or .cse0 .cse1 (= 10 |old(~a19~0)|) .cse2 .cse3) (or .cse4 .cse0 .cse2 .cse3 (< 33 |old(~a1~0)|)) (or (and (= 8 ~a19~0) .cse5) (not (= 8 |old(~a19~0)|))) (or .cse4 .cse2 .cse3 .cse0 (= 1 |old(~a10~0)|)) (or .cse1 .cse4 .cse2 .cse3 .cse0) (or .cse4 .cse2 .cse3 (<= |old(~a1~0)| 218) .cse0)))) [2018-11-10 09:30:51,383 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-11-10 09:30:51,383 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-11-10 09:30:51,383 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-11-10 09:30:51,383 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,383 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,383 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,383 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,383 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,383 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,383 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-11-10 09:30:51,383 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-10 09:30:51,384 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:30:51,385 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-11-10 09:30:51,385 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 09:30:51,385 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 09:30:51,386 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-11-10 09:30:51,386 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-11-10 09:30:51,386 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse0 (not (= ~a10~0 4))) (.cse1 (not (= 7 ~a19~0)))) (or (and (not (= ~a10~0 1)) .cse0) (and (< 218 ~a1~0) .cse0) (and (<= ~a1~0 33) .cse0) (and .cse1 .cse0) (and .cse1 (not (= ~a19~0 10))) (< (+ |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-11-10 09:30:51,386 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-10 09:30:51,386 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-10 09:30:51,386 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-11-10 09:30:51,386 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse0 (not (= ~a10~0 4))) (.cse1 (not (= 7 ~a19~0)))) (or (and (not (= ~a10~0 1)) .cse0) (and (< 218 ~a1~0) .cse0) (and (<= ~a1~0 33) .cse0) (and .cse1 .cse0) (and .cse1 (not (= ~a19~0 10))) (< (+ |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-11-10 09:30:51,386 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-11-10 09:30:51,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:30:51 BoogieIcfgContainer [2018-11-10 09:30:51,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 09:30:51,396 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:30:51,396 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:30:51,396 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:30:51,397 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:18:37" (3/4) ... [2018-11-10 09:30:51,400 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 09:30:51,404 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 09:30:51,404 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-10 09:30:51,404 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 09:30:51,415 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 09:30:51,416 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 09:30:51,437 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(a10 == 1) && !(a10 == 4)) || (218 < a1 && !(a10 == 4))) || (a1 <= 33 && !(a10 == 4))) || (!(7 == a19) && !(a10 == 4))) || (!(7 == a19) && !(a19 == 10))) || \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-11-10 09:30:51,507 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ed34ba2a-81fd-4d24-8c63-f1e244dd87d3/bin-2019/utaipan/witness.graphml [2018-11-10 09:30:51,507 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:30:51,508 INFO L168 Benchmark]: Toolchain (without parser) took 735353.68 ms. Allocated memory was 1.0 GB in the beginning and 6.1 GB in the end (delta: 5.1 GB). Free memory was 952.3 MB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-11-10 09:30:51,508 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:30:51,509 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.54 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 922.8 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-10 09:30:51,509 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 922.8 MB in the beginning and 1.2 GB in the end (delta: -232.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2018-11-10 09:30:51,509 INFO L168 Benchmark]: Boogie Preprocessor took 49.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:30:51,509 INFO L168 Benchmark]: RCFGBuilder took 894.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 113.0 MB). Peak memory consumption was 113.0 MB. Max. memory is 11.5 GB. [2018-11-10 09:30:51,510 INFO L168 Benchmark]: TraceAbstraction took 733828.55 ms. Allocated memory was 1.2 GB in the beginning and 6.1 GB in the end (delta: 4.9 GB). Free memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 6.1 GB. Max. memory is 11.5 GB. [2018-11-10 09:30:51,510 INFO L168 Benchmark]: Witness Printer took 110.75 ms. Allocated memory is still 6.1 GB. Free memory was 4.7 GB in the beginning and 4.7 GB in the end (delta: 67.5 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. [2018-11-10 09:30:51,515 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 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 349.54 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 922.8 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 117.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 922.8 MB in the beginning and 1.2 GB in the end (delta: -232.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 894.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 113.0 MB). Peak memory consumption was 113.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 733828.55 ms. Allocated memory was 1.2 GB in the beginning and 6.1 GB in the end (delta: 4.9 GB). Free memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 6.1 GB. Max. memory is 11.5 GB. * Witness Printer took 110.75 ms. Allocated memory is still 6.1 GB. Free memory was 4.7 GB in the beginning and 4.7 GB in the end (delta: 67.5 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 196]: 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: (((((((((((((((((!(a10 == 1) && !(a10 == 4)) || (218 < a1 && !(a10 == 4))) || (a1 <= 33 && !(a10 == 4))) || (!(7 == a19) && !(a10 == 4))) || (!(7 == a19) && !(a19 == 10))) || \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, 733.7s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 351.7s AutomataDifference, 0.0s DeadEndRemovalTime, 224.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1461 SDtfs, 10875 SDslu, 1593 SDs, 0 SdLazy, 17892 SolverSat, 2539 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 176.0s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 3073 GetRequests, 2632 SyntacticMatches, 236 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4673 ImplicationChecksByTransitivity, 77.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9381occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 77.1s AbstIntTime, 6 AbstIntIterations, 4 AbstIntStrong, 0.9960699661264041 AbsIntWeakeningRatio, 0.09023668639053255 AbsIntAvgWeakeningVarsNumRemoved, 403.9526627218935 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 395 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 213 PreInvPairs, 313 NumberOfFragments, 554 HoareAnnotationTreeSize, 213 FomulaSimplifications, 218181 FormulaSimplificationTreeSizeReduction, 100.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 399550 FormulaSimplificationTreeSizeReductionInter, 123.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 3834 NumberOfCodeBlocks, 3834 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 4591 ConstructedInterpolants, 200 QuantifiedInterpolants, 13370063 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1198 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 3555/4982 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...