./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label59_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_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label59_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/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 5f1f3e9c958502587d73771213325403adeeeeae ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:46:10,405 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:46:10,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:46:10,412 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:46:10,412 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:46:10,413 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:46:10,413 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:46:10,415 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:46:10,416 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:46:10,416 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:46:10,417 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:46:10,417 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:46:10,418 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:46:10,418 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:46:10,419 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:46:10,419 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:46:10,420 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:46:10,421 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:46:10,422 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:46:10,423 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:46:10,424 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:46:10,425 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:46:10,426 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:46:10,427 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:46:10,427 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:46:10,427 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:46:10,429 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:46:10,429 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:46:10,429 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:46:10,430 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:46:10,430 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:46:10,430 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:46:10,430 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:46:10,431 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:46:10,431 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:46:10,432 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:46:10,432 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 09:46:10,440 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:46:10,440 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:46:10,441 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 09:46:10,441 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 09:46:10,441 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 09:46:10,441 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 09:46:10,442 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 09:46:10,442 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 09:46:10,442 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 09:46:10,442 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 09:46:10,442 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 09:46:10,443 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:46:10,443 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 09:46:10,443 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:46:10,443 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 09:46:10,443 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:46:10,443 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 09:46:10,443 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 09:46:10,443 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 09:46:10,444 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 09:46:10,444 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:46:10,444 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 09:46:10,444 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:46:10,444 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:46:10,444 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 09:46:10,444 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 09:46:10,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 09:46:10,445 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:46:10,445 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 09:46:10,445 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 09:46:10,445 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 09:46:10,445 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 09:46:10,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 09:46:10,445 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 09:46:10,446 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_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/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 -> 5f1f3e9c958502587d73771213325403adeeeeae [2018-11-10 09:46:10,469 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:46:10,478 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:46:10,481 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:46:10,482 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:46:10,482 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:46:10,483 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label59_true-unreach-call.c [2018-11-10 09:46:10,527 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/bin-2019/utaipan/data/5759a5d6b/2d0b4ddfdaa2468cbfc7a182f20ff2da/FLAGdaca2e41e [2018-11-10 09:46:10,999 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:46:11,000 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/sv-benchmarks/c/eca-rers2012/Problem10_label59_true-unreach-call.c [2018-11-10 09:46:11,010 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/bin-2019/utaipan/data/5759a5d6b/2d0b4ddfdaa2468cbfc7a182f20ff2da/FLAGdaca2e41e [2018-11-10 09:46:11,021 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/bin-2019/utaipan/data/5759a5d6b/2d0b4ddfdaa2468cbfc7a182f20ff2da [2018-11-10 09:46:11,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:46:11,024 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:46:11,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:46:11,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:46:11,027 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:46:11,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:46:11" (1/1) ... [2018-11-10 09:46:11,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb581ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:46:11, skipping insertion in model container [2018-11-10 09:46:11,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:46:11" (1/1) ... [2018-11-10 09:46:11,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:46:11,067 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:46:11,283 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:46:11,287 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:46:11,355 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:46:11,366 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:46:11,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:46:11 WrapperNode [2018-11-10 09:46:11,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:46:11,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:46:11,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:46:11,368 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:46:11,375 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:46:11" (1/1) ... [2018-11-10 09:46:11,442 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:46:11" (1/1) ... [2018-11-10 09:46:11,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:46:11,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:46:11,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:46:11,484 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:46:11,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:46:11" (1/1) ... [2018-11-10 09:46:11,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:46:11" (1/1) ... [2018-11-10 09:46:11,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:46:11" (1/1) ... [2018-11-10 09:46:11,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:46:11" (1/1) ... [2018-11-10 09:46:11,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:46:11" (1/1) ... [2018-11-10 09:46:11,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:46:11" (1/1) ... [2018-11-10 09:46:11,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:46:11" (1/1) ... [2018-11-10 09:46:11,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:46:11,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:46:11,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:46:11,531 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:46:11,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:46:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/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:46:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 09:46:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 09:46:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-10 09:46:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-10 09:46:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:46:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:46:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 09:46:11,579 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 09:46:12,566 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:46:12,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:46:12 BoogieIcfgContainer [2018-11-10 09:46:12,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:46:12,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 09:46:12,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 09:46:12,569 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 09:46:12,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:46:11" (1/3) ... [2018-11-10 09:46:12,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6768b8d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:46:12, skipping insertion in model container [2018-11-10 09:46:12,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:46:11" (2/3) ... [2018-11-10 09:46:12,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6768b8d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:46:12, skipping insertion in model container [2018-11-10 09:46:12,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:46:12" (3/3) ... [2018-11-10 09:46:12,574 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label59_true-unreach-call.c [2018-11-10 09:46:12,582 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 09:46:12,588 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 09:46:12,601 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 09:46:12,627 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 09:46:12,627 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 09:46:12,627 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 09:46:12,627 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:46:12,627 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:46:12,628 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 09:46:12,628 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:46:12,628 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 09:46:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-10 09:46:12,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 09:46:12,652 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:46:12,652 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:46:12,654 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:46:12,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:46:12,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1019321972, now seen corresponding path program 1 times [2018-11-10 09:46:12,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:46:12,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:46:12,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:46:12,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:46:12,702 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:46:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:46:12,916 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:46:12,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:46:12,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:46:12,919 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:46:12,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 09:46:12,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:46:12,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:46:12,936 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 4 states. [2018-11-10 09:46:13,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:46:13,799 INFO L93 Difference]: Finished difference Result 737 states and 1298 transitions. [2018-11-10 09:46:13,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:46:13,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-11-10 09:46:13,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:46:13,813 INFO L225 Difference]: With dead ends: 737 [2018-11-10 09:46:13,813 INFO L226 Difference]: Without dead ends: 515 [2018-11-10 09:46:13,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:46:13,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-11-10 09:46:13,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 356. [2018-11-10 09:46:13,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-10 09:46:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 613 transitions. [2018-11-10 09:46:13,866 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 613 transitions. Word has length 72 [2018-11-10 09:46:13,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:46:13,866 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 613 transitions. [2018-11-10 09:46:13,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 09:46:13,867 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 613 transitions. [2018-11-10 09:46:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-10 09:46:13,872 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:46:13,872 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:46:13,874 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:46:13,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:46:13,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1630388773, now seen corresponding path program 1 times [2018-11-10 09:46:13,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:46:13,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:46:13,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:46:13,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:46:13,877 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:46:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:46:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:46:14,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:46:14,051 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:46:14,051 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2018-11-10 09:46:14,052 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], [473], [477], [479], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 09:46:14,087 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:46:14,087 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:46:15,286 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:46:16,872 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:46:16,873 INFO L272 AbstractInterpreter]: Visited 79 different actions 223 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:46:16,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:46:16,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:46:16,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:46:16,879 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/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:46:16,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:46:16,885 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:46:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:46:16,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:46:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:46:17,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:46:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:46:17,073 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 09:46:17,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2018-11-10 09:46:17,073 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:46:17,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:46:17,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:46:17,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-10 09:46:17,074 INFO L87 Difference]: Start difference. First operand 356 states and 613 transitions. Second operand 3 states. [2018-11-10 09:46:17,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:46:17,455 INFO L93 Difference]: Finished difference Result 994 states and 1782 transitions. [2018-11-10 09:46:17,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:46:17,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2018-11-10 09:46:17,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:46:17,459 INFO L225 Difference]: With dead ends: 994 [2018-11-10 09:46:17,459 INFO L226 Difference]: Without dead ends: 644 [2018-11-10 09:46:17,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 286 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-10 09:46:17,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-11-10 09:46:17,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2018-11-10 09:46:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2018-11-10 09:46:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1034 transitions. [2018-11-10 09:46:17,483 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1034 transitions. Word has length 143 [2018-11-10 09:46:17,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:46:17,484 INFO L481 AbstractCegarLoop]: Abstraction has 644 states and 1034 transitions. [2018-11-10 09:46:17,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:46:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1034 transitions. [2018-11-10 09:46:17,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 09:46:17,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:46:17,489 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, 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:46:17,489 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:46:17,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:46:17,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1733767164, now seen corresponding path program 1 times [2018-11-10 09:46:17,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:46:17,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:46:17,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:46:17,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:46:17,491 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:46:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:46:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:46:17,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:46:17,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 09:46:17,604 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:46:17,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 09:46:17,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 09:46:17,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:46:17,605 INFO L87 Difference]: Start difference. First operand 644 states and 1034 transitions. Second operand 6 states. [2018-11-10 09:46:18,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:46:18,501 INFO L93 Difference]: Finished difference Result 1847 states and 3197 transitions. [2018-11-10 09:46:18,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 09:46:18,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2018-11-10 09:46:18,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:46:18,512 INFO L225 Difference]: With dead ends: 1847 [2018-11-10 09:46:18,512 INFO L226 Difference]: Without dead ends: 1209 [2018-11-10 09:46:18,517 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:46:18,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2018-11-10 09:46:18,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1185. [2018-11-10 09:46:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2018-11-10 09:46:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1872 transitions. [2018-11-10 09:46:18,556 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1872 transitions. Word has length 154 [2018-11-10 09:46:18,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:46:18,556 INFO L481 AbstractCegarLoop]: Abstraction has 1185 states and 1872 transitions. [2018-11-10 09:46:18,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 09:46:18,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1872 transitions. [2018-11-10 09:46:18,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-10 09:46:18,562 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:46:18,562 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:46:18,562 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:46:18,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:46:18,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1561785849, now seen corresponding path program 1 times [2018-11-10 09:46:18,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:46:18,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:46:18,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:46:18,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:46:18,564 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:46:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:46:18,675 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:46:18,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:46:18,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:46:18,675 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:46:18,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 09:46:18,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:46:18,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:46:18,676 INFO L87 Difference]: Start difference. First operand 1185 states and 1872 transitions. Second operand 4 states. [2018-11-10 09:46:21,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:46:21,446 INFO L93 Difference]: Finished difference Result 2364 states and 3744 transitions. [2018-11-10 09:46:21,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:46:21,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-11-10 09:46:21,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:46:21,453 INFO L225 Difference]: With dead ends: 2364 [2018-11-10 09:46:21,454 INFO L226 Difference]: Without dead ends: 1185 [2018-11-10 09:46:21,458 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:46:21,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2018-11-10 09:46:21,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2018-11-10 09:46:21,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2018-11-10 09:46:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1698 transitions. [2018-11-10 09:46:21,485 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1698 transitions. Word has length 201 [2018-11-10 09:46:21,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:46:21,485 INFO L481 AbstractCegarLoop]: Abstraction has 1185 states and 1698 transitions. [2018-11-10 09:46:21,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 09:46:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1698 transitions. [2018-11-10 09:46:21,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 09:46:21,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:46:21,489 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:46:21,489 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:46:21,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:46:21,490 INFO L82 PathProgramCache]: Analyzing trace with hash -809847816, now seen corresponding path program 1 times [2018-11-10 09:46:21,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:46:21,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:46:21,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:46:21,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:46:21,491 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:46:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:46:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:46:21,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:46:21,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 09:46:21,635 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:46:21,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 09:46:21,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 09:46:21,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:46:21,635 INFO L87 Difference]: Start difference. First operand 1185 states and 1698 transitions. Second operand 6 states. [2018-11-10 09:46:22,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:46:22,138 INFO L93 Difference]: Finished difference Result 3008 states and 4520 transitions. [2018-11-10 09:46:22,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 09:46:22,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2018-11-10 09:46:22,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:46:22,147 INFO L225 Difference]: With dead ends: 3008 [2018-11-10 09:46:22,147 INFO L226 Difference]: Without dead ends: 1829 [2018-11-10 09:46:22,151 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:46:22,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2018-11-10 09:46:22,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1793. [2018-11-10 09:46:22,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2018-11-10 09:46:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2543 transitions. [2018-11-10 09:46:22,197 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2543 transitions. Word has length 204 [2018-11-10 09:46:22,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:46:22,198 INFO L481 AbstractCegarLoop]: Abstraction has 1793 states and 2543 transitions. [2018-11-10 09:46:22,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 09:46:22,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2543 transitions. [2018-11-10 09:46:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-10 09:46:22,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:46:22,203 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, 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] [2018-11-10 09:46:22,203 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:46:22,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:46:22,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1298522180, now seen corresponding path program 1 times [2018-11-10 09:46:22,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:46:22,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:46:22,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:46:22,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:46:22,205 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:46:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:46:22,330 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 130 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 09:46:22,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:46:22,330 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:46:22,330 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-11-10 09:46:22,331 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], [473], [477], [479], [482], [490], [494], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 09:46:22,335 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:46:22,335 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:46:23,501 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:46:23,535 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 09:46:23,535 INFO L272 AbstractInterpreter]: Visited 87 different actions 87 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-10 09:46:23,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:46:23,540 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 09:46:25,560 INFO L227 lantSequenceWeakener]: Weakened 203 states. On average, predicates are now at 74.19% of their original sizes. [2018-11-10 09:46:25,560 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 09:46:26,995 INFO L415 sIntCurrentIteration]: We unified 223 AI predicates to 223 [2018-11-10 09:46:26,995 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 09:46:26,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 09:46:26,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-10 09:46:26,996 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:46:26,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 09:46:26,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 09:46:26,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 09:46:26,997 INFO L87 Difference]: Start difference. First operand 1793 states and 2543 transitions. Second operand 10 states. [2018-11-10 09:46:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:46:49,838 INFO L93 Difference]: Finished difference Result 3729 states and 5328 transitions. [2018-11-10 09:46:49,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 09:46:49,838 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 224 [2018-11-10 09:46:49,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:46:49,845 INFO L225 Difference]: With dead ends: 3729 [2018-11-10 09:46:49,845 INFO L226 Difference]: Without dead ends: 1942 [2018-11-10 09:46:49,850 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 227 GetRequests, 204 SyntacticMatches, 11 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-11-10 09:46:49,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2018-11-10 09:46:49,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1937. [2018-11-10 09:46:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1937 states. [2018-11-10 09:46:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1937 states and 2695 transitions. [2018-11-10 09:46:49,926 INFO L78 Accepts]: Start accepts. Automaton has 1937 states and 2695 transitions. Word has length 224 [2018-11-10 09:46:49,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:46:49,926 INFO L481 AbstractCegarLoop]: Abstraction has 1937 states and 2695 transitions. [2018-11-10 09:46:49,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 09:46:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 2695 transitions. [2018-11-10 09:46:49,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-10 09:46:49,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:46:49,932 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, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:46:49,933 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:46:49,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:46:49,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1893058164, now seen corresponding path program 1 times [2018-11-10 09:46:49,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:46:49,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:46:49,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:46:49,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:46:49,934 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:46:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:46:50,184 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 134 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:46:50,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:46:50,185 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:46:50,186 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2018-11-10 09:46:50,186 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], [473], [477], [479], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 09:46:50,189 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:46:50,189 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:46:50,740 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:46:53,873 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:46:53,873 INFO L272 AbstractInterpreter]: Visited 96 different actions 275 times. Merged at 5 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 09:46:53,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:46:53,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:46:53,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:46:53,876 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/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:46:53,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:46:53,882 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:46:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:46:53,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:47:04,463 WARN L179 SmtUtils]: Spent 10.46 s on a formula simplification. DAG size of input: 113 DAG size of output: 48 [2018-11-10 09:47:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 133 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:47:04,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:47:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 133 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:47:04,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:47:04,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 14 [2018-11-10 09:47:04,701 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:47:04,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 09:47:04,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 09:47:04,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-10 09:47:04,701 INFO L87 Difference]: Start difference. First operand 1937 states and 2695 transitions. Second operand 12 states. [2018-11-10 09:47:09,868 WARN L179 SmtUtils]: Spent 4.27 s on a formula simplification that was a NOOP. DAG size: 53 [2018-11-10 09:47:14,372 WARN L179 SmtUtils]: Spent 4.42 s on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2018-11-10 09:47:25,430 WARN L179 SmtUtils]: Spent 5.59 s on a formula simplification. DAG size of input: 57 DAG size of output: 26 [2018-11-10 09:47:28,321 WARN L179 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 54 DAG size of output: 28 [2018-11-10 09:47:34,654 WARN L179 SmtUtils]: Spent 6.24 s on a formula simplification that was a NOOP. DAG size: 53 [2018-11-10 09:47:42,163 WARN L179 SmtUtils]: Spent 7.39 s on a formula simplification that was a NOOP. DAG size: 55 [2018-11-10 09:47:54,703 WARN L179 SmtUtils]: Spent 12.49 s on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2018-11-10 09:47:58,289 WARN L179 SmtUtils]: Spent 3.42 s on a formula simplification. DAG size of input: 61 DAG size of output: 14 [2018-11-10 09:48:01,375 WARN L179 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 57 DAG size of output: 25 [2018-11-10 09:48:03,269 WARN L179 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 56 DAG size of output: 31 [2018-11-10 09:48:07,461 WARN L179 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2018-11-10 09:48:12,502 WARN L179 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 53 DAG size of output: 28 [2018-11-10 09:48:22,181 WARN L179 SmtUtils]: Spent 8.59 s on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-11-10 09:48:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:48:22,981 INFO L93 Difference]: Finished difference Result 5680 states and 8469 transitions. [2018-11-10 09:48:22,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-10 09:48:22,981 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 230 [2018-11-10 09:48:22,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:48:22,996 INFO L225 Difference]: With dead ends: 5680 [2018-11-10 09:48:22,996 INFO L226 Difference]: Without dead ends: 3893 [2018-11-10 09:48:23,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 481 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 78.1s TimeCoverageRelationStatistics Valid=733, Invalid=2234, Unknown=3, NotChecked=0, Total=2970 [2018-11-10 09:48:23,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3893 states. [2018-11-10 09:48:23,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3893 to 3784. [2018-11-10 09:48:23,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2018-11-10 09:48:23,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 4772 transitions. [2018-11-10 09:48:23,127 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 4772 transitions. Word has length 230 [2018-11-10 09:48:23,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:48:23,127 INFO L481 AbstractCegarLoop]: Abstraction has 3784 states and 4772 transitions. [2018-11-10 09:48:23,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 09:48:23,127 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 4772 transitions. [2018-11-10 09:48:23,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-10 09:48:23,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:48:23,134 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, 3, 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] [2018-11-10 09:48:23,134 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:48:23,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:48:23,134 INFO L82 PathProgramCache]: Analyzing trace with hash -353802736, now seen corresponding path program 1 times [2018-11-10 09:48:23,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:48:23,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:48:23,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:48:23,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:48:23,135 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:48:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:48:23,287 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 131 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-10 09:48:23,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:48:23,287 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:48:23,287 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2018-11-10 09:48:23,287 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], [473], [477], [479], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 09:48:23,290 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:48:23,290 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:48:24,367 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:48:31,331 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 09:48:31,331 INFO L272 AbstractInterpreter]: Visited 90 different actions 510 times. Merged at 5 different actions 25 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 09:48:31,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:48:31,333 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 09:48:32,918 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 77.56% of their original sizes. [2018-11-10 09:48:32,919 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 09:48:48,587 INFO L415 sIntCurrentIteration]: We unified 233 AI predicates to 233 [2018-11-10 09:48:48,587 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 09:48:48,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 09:48:48,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [8] total 26 [2018-11-10 09:48:48,588 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:48:48,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 09:48:48,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 09:48:48,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-10 09:48:48,588 INFO L87 Difference]: Start difference. First operand 3784 states and 4772 transitions. Second operand 20 states. [2018-11-10 09:50:31,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:31,549 INFO L93 Difference]: Finished difference Result 8752 states and 11096 transitions. [2018-11-10 09:50:31,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 09:50:31,549 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 234 [2018-11-10 09:50:31,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:50:31,558 INFO L225 Difference]: With dead ends: 8752 [2018-11-10 09:50:31,558 INFO L226 Difference]: Without dead ends: 5118 [2018-11-10 09:50:31,563 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 241 GetRequests, 189 SyntacticMatches, 26 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=186, Invalid=570, Unknown=0, NotChecked=0, Total=756 [2018-11-10 09:50:31,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5118 states. [2018-11-10 09:50:31,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5118 to 5113. [2018-11-10 09:50:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5113 states. [2018-11-10 09:50:31,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5113 states to 5113 states and 6231 transitions. [2018-11-10 09:50:31,666 INFO L78 Accepts]: Start accepts. Automaton has 5113 states and 6231 transitions. Word has length 234 [2018-11-10 09:50:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:50:31,666 INFO L481 AbstractCegarLoop]: Abstraction has 5113 states and 6231 transitions. [2018-11-10 09:50:31,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 09:50:31,666 INFO L276 IsEmpty]: Start isEmpty. Operand 5113 states and 6231 transitions. [2018-11-10 09:50:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-11-10 09:50:31,673 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:50:31,674 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, 3, 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] [2018-11-10 09:50:31,674 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:50:31,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:31,674 INFO L82 PathProgramCache]: Analyzing trace with hash -2020299652, now seen corresponding path program 1 times [2018-11-10 09:50:31,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:50:31,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:31,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:31,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:31,675 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:50:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 66 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:50:31,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:31,834 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:50:31,834 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 293 with the following transitions: [2018-11-10 09:50:31,834 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], [473], [477], [479], [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], [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:50:31,837 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:50:31,838 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:50:32,890 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:50:51,245 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:50:51,246 INFO L272 AbstractInterpreter]: Visited 147 different actions 863 times. Merged at 7 different actions 38 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-10 09:50:51,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:51,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:50:51,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:51,248 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:50:51,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:51,253 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:50:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:51,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:50:51,347 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-10 09:50:51,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:50:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-10 09:50:51,406 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 09:50:51,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2018-11-10 09:50:51,407 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:50:51,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:50:51,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:50:51,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-10 09:50:51,407 INFO L87 Difference]: Start difference. First operand 5113 states and 6231 transitions. Second operand 3 states. [2018-11-10 09:50:51,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:50:51,781 INFO L93 Difference]: Finished difference Result 9471 states and 11655 transitions. [2018-11-10 09:50:51,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:50:51,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2018-11-10 09:50:51,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:50:51,795 INFO L225 Difference]: With dead ends: 9471 [2018-11-10 09:50:51,795 INFO L226 Difference]: Without dead ends: 5113 [2018-11-10 09:50:51,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 584 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-10 09:50:51,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5113 states. [2018-11-10 09:50:51,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5113 to 4763. [2018-11-10 09:50:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4763 states. [2018-11-10 09:50:51,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4763 states to 4763 states and 5608 transitions. [2018-11-10 09:50:51,955 INFO L78 Accepts]: Start accepts. Automaton has 4763 states and 5608 transitions. Word has length 292 [2018-11-10 09:50:51,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:50:51,955 INFO L481 AbstractCegarLoop]: Abstraction has 4763 states and 5608 transitions. [2018-11-10 09:50:51,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:50:51,956 INFO L276 IsEmpty]: Start isEmpty. Operand 4763 states and 5608 transitions. [2018-11-10 09:50:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-11-10 09:50:51,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:50:51,968 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:50:51,969 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:50:51,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:50:51,969 INFO L82 PathProgramCache]: Analyzing trace with hash 42349603, now seen corresponding path program 1 times [2018-11-10 09:50:51,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:50:51,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:51,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:50:51,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:50:51,970 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:50:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:50:52,171 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 201 proven. 163 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-10 09:50:52,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:50:52,171 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:50:52,172 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 328 with the following transitions: [2018-11-10 09:50:52,172 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], [473], [477], [479], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [562], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 09:50:52,174 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:50:52,174 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:50:53,155 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:51:23,357 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:51:23,357 INFO L272 AbstractInterpreter]: Visited 98 different actions 671 times. Merged at 8 different actions 54 times. Widened at 1 different actions 2 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-10 09:51:23,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:23,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:51:23,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:51:23,359 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:51:23,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:23,365 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:51:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:23,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:23,474 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 374 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 09:51:23,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 278 proven. 86 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-10 09:51:23,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:51:23,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-10 09:51:23,577 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:51:23,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 09:51:23,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 09:51:23,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-10 09:51:23,578 INFO L87 Difference]: Start difference. First operand 4763 states and 5608 transitions. Second operand 11 states. [2018-11-10 09:51:25,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:51:25,011 INFO L93 Difference]: Finished difference Result 12155 states and 15094 transitions. [2018-11-10 09:51:25,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 09:51:25,013 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 327 [2018-11-10 09:51:25,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:51:25,018 INFO L225 Difference]: With dead ends: 12155 [2018-11-10 09:51:25,018 INFO L226 Difference]: Without dead ends: 3399 [2018-11-10 09:51:25,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 661 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-11-10 09:51:25,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2018-11-10 09:51:25,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 2672. [2018-11-10 09:51:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2672 states. [2018-11-10 09:51:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2672 states to 2672 states and 2970 transitions. [2018-11-10 09:51:25,124 INFO L78 Accepts]: Start accepts. Automaton has 2672 states and 2970 transitions. Word has length 327 [2018-11-10 09:51:25,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:51:25,124 INFO L481 AbstractCegarLoop]: Abstraction has 2672 states and 2970 transitions. [2018-11-10 09:51:25,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 09:51:25,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2672 states and 2970 transitions. [2018-11-10 09:51:25,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-11-10 09:51:25,131 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:51:25,131 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:51:25,131 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:51:25,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:25,132 INFO L82 PathProgramCache]: Analyzing trace with hash -366661461, now seen corresponding path program 1 times [2018-11-10 09:51:25,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:51:25,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:51:25,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:25,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:51:25,133 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:51:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 286 proven. 166 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 09:51:25,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:51:25,553 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:51:25,553 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 364 with the following transitions: [2018-11-10 09:51:25,553 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], [473], [477], [479], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [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:51:25,556 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:51:25,556 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:51:27,408 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:51:54,627 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:51:54,627 INFO L272 AbstractInterpreter]: Visited 126 different actions 748 times. Merged at 8 different actions 49 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-10 09:51:54,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:54,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:51:54,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:51:54,629 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:51:54,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:54,635 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:51:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:54,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:51:54,746 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 370 proven. 2 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-10 09:51:54,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:51:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 370 proven. 2 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-10 09:51:54,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:51:54,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 16 [2018-11-10 09:51:54,890 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:51:54,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 09:51:54,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 09:51:54,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-11-10 09:51:54,891 INFO L87 Difference]: Start difference. First operand 2672 states and 2970 transitions. Second operand 15 states. [2018-11-10 09:51:57,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:51:57,333 INFO L93 Difference]: Finished difference Result 6781 states and 7786 transitions. [2018-11-10 09:51:57,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-10 09:51:57,333 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 363 [2018-11-10 09:51:57,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:51:57,340 INFO L225 Difference]: With dead ends: 6781 [2018-11-10 09:51:57,340 INFO L226 Difference]: Without dead ends: 4259 [2018-11-10 09:51:57,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 750 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=468, Invalid=1982, Unknown=0, NotChecked=0, Total=2450 [2018-11-10 09:51:57,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2018-11-10 09:51:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 3428. [2018-11-10 09:51:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3428 states. [2018-11-10 09:51:57,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3428 states to 3428 states and 3802 transitions. [2018-11-10 09:51:57,450 INFO L78 Accepts]: Start accepts. Automaton has 3428 states and 3802 transitions. Word has length 363 [2018-11-10 09:51:57,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:51:57,451 INFO L481 AbstractCegarLoop]: Abstraction has 3428 states and 3802 transitions. [2018-11-10 09:51:57,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 09:51:57,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3428 states and 3802 transitions. [2018-11-10 09:51:57,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-11-10 09:51:57,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:51:57,456 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:57,456 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:51:57,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:51:57,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1827425236, now seen corresponding path program 1 times [2018-11-10 09:51:57,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:51:57,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:51:57,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:51:57,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:51:57,458 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:51:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:51:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 256 proven. 223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:51:58,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:51:58,030 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:51:58,030 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 405 with the following transitions: [2018-11-10 09:51:58,030 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], [473], [477], [479], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 09:51:58,033 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:51:58,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:51:59,679 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:52:16,939 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:52:16,939 INFO L272 AbstractInterpreter]: Visited 145 different actions 1008 times. Merged at 8 different actions 61 times. Widened at 1 different actions 3 times. Found 12 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-10 09:52:16,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:52:16,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:52:16,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:52:16,945 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:52:16,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:52:16,950 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:52:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:52:17,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:52:19,628 WARN L179 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 123 DAG size of output: 62 [2018-11-10 09:52:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 168 proven. 208 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-10 09:52:19,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:52:20,178 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:20,366 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2018-11-10 09:52:20,369 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:20,416 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:20,461 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:20,508 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:20,555 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:20,604 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:20,648 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:20,692 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:20,741 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:20,784 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:20,849 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:20,912 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:20,974 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,020 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,067 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,120 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,163 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,203 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,245 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,295 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,335 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,391 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,444 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,487 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,531 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,571 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,628 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,682 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,729 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,771 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,810 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,852 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,893 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,933 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:21,973 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,012 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,066 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,111 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,161 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,200 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,241 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,280 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,321 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,361 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,402 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,447 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,487 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,528 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,587 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,638 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,691 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,736 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,779 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,819 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,858 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,898 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,938 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:22,998 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,038 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,079 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,137 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,188 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,241 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,284 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,338 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,390 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,442 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,486 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,530 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,574 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,617 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,661 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,704 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,743 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,782 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,821 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,860 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,911 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:23,950 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:52:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 370 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-10 09:52:24,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:52:24,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 6] total 28 [2018-11-10 09:52:24,349 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:52:24,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-10 09:52:24,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 09:52:24,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=654, Unknown=1, NotChecked=0, Total=756 [2018-11-10 09:52:24,350 INFO L87 Difference]: Start difference. First operand 3428 states and 3802 transitions. Second operand 25 states. [2018-11-10 09:52:27,587 WARN L179 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2018-11-10 09:52:51,311 WARN L179 SmtUtils]: Spent 5.50 s on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2018-11-10 09:52:54,372 WARN L179 SmtUtils]: Spent 996.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2018-11-10 09:53:02,065 WARN L179 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2018-11-10 09:53:04,110 WARN L179 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 128 DAG size of output: 93 [2018-11-10 09:53:07,780 WARN L179 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2018-11-10 09:53:16,892 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 102 [2018-11-10 09:53:20,044 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 87 DAG size of output: 40 [2018-11-10 09:53:30,311 WARN L179 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 129 DAG size of output: 94 [2018-11-10 09:53:38,793 WARN L179 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-11-10 09:54:05,123 WARN L179 SmtUtils]: Spent 4.53 s on a formula simplification. DAG size of input: 120 DAG size of output: 77 [2018-11-10 09:54:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:40,292 INFO L93 Difference]: Finished difference Result 9480 states and 10701 transitions. [2018-11-10 09:54:40,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-11-10 09:54:40,293 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 404 [2018-11-10 09:54:40,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:40,305 INFO L225 Difference]: With dead ends: 9480 [2018-11-10 09:54:40,305 INFO L226 Difference]: Without dead ends: 6202 [2018-11-10 09:54:40,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 949 GetRequests, 734 SyntacticMatches, 88 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7145 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=2644, Invalid=13858, Unknown=10, NotChecked=0, Total=16512 [2018-11-10 09:54:40,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6202 states. [2018-11-10 09:54:40,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6202 to 4588. [2018-11-10 09:54:40,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4588 states. [2018-11-10 09:54:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4588 states to 4588 states and 4986 transitions. [2018-11-10 09:54:40,406 INFO L78 Accepts]: Start accepts. Automaton has 4588 states and 4986 transitions. Word has length 404 [2018-11-10 09:54:40,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:40,407 INFO L481 AbstractCegarLoop]: Abstraction has 4588 states and 4986 transitions. [2018-11-10 09:54:40,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-10 09:54:40,407 INFO L276 IsEmpty]: Start isEmpty. Operand 4588 states and 4986 transitions. [2018-11-10 09:54:40,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2018-11-10 09:54:40,413 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:40,414 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1] [2018-11-10 09:54:40,414 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:40,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:40,414 INFO L82 PathProgramCache]: Analyzing trace with hash 944268975, now seen corresponding path program 1 times [2018-11-10 09:54:40,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:40,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:40,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:40,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:40,415 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:41,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 556 proven. 411 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-11-10 09:54:41,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:54:41,463 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 09:54:41,463 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 612 with the following transitions: [2018-11-10 09:54:41,463 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], [473], [477], [479], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [730], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 09:54:41,465 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 09:54:41,465 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 09:54:41,972 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 09:55:15,326 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 09:55:15,326 INFO L272 AbstractInterpreter]: Visited 147 different actions 1637 times. Merged at 10 different actions 133 times. Widened at 1 different actions 6 times. Found 38 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-10 09:55:15,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:55:15,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 09:55:15,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:55:15,332 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:55:15,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:55:15,338 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 09:55:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:15,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:55:17,255 WARN L179 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 72 DAG size of output: 23 [2018-11-10 09:55:19,017 WARN L179 SmtUtils]: Spent 875.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-10 09:55:21,923 WARN L179 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 123 DAG size of output: 62 [2018-11-10 09:55:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 832 proven. 136 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-11-10 09:55:23,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 09:55:23,571 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:23,731 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:23,783 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:23,832 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:23,885 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:23,937 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:23,981 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,026 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,070 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,115 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,161 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,206 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,252 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,299 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,345 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,404 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,456 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,499 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,544 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,591 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,636 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,681 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,727 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,773 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,825 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,870 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,915 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:24,960 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,006 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,052 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,097 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,141 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,187 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,233 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,277 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,321 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,382 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,443 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,496 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,556 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,614 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,675 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,725 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,769 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,815 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,863 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,907 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,952 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:25,998 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,042 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,087 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,130 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,175 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,233 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,277 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,321 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,367 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,412 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,456 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,501 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,546 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,590 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,638 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,682 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,727 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,772 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,817 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,861 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,908 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,953 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:26,999 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:27,044 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:27,090 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:27,135 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:27,180 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:27,224 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:27,269 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:27,313 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:27,358 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:27,403 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 09:55:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 671 proven. 2 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-11-10 09:55:27,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 09:55:27,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9, 6] total 31 [2018-11-10 09:55:27,962 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 09:55:27,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-10 09:55:27,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 09:55:27,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=809, Unknown=2, NotChecked=0, Total=930 [2018-11-10 09:55:27,963 INFO L87 Difference]: Start difference. First operand 4588 states and 4986 transitions. Second operand 27 states. [2018-11-10 09:55:29,037 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 109 [2018-11-10 09:55:31,465 WARN L179 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 112 DAG size of output: 95 [2018-11-10 09:55:34,299 WARN L179 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 129 DAG size of output: 82 [2018-11-10 09:55:38,662 WARN L179 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2018-11-10 09:55:40,300 WARN L179 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2018-11-10 09:55:43,508 WARN L179 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2018-11-10 09:55:46,580 WARN L179 SmtUtils]: Spent 899.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-10 09:55:50,765 WARN L179 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2018-11-10 09:55:57,414 WARN L179 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 70 DAG size of output: 39 [2018-11-10 09:55:59,288 WARN L179 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2018-11-10 09:56:01,729 WARN L179 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 69 DAG size of output: 40 [2018-11-10 09:56:05,574 WARN L179 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2018-11-10 09:56:07,509 WARN L179 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2018-11-10 09:56:08,149 WARN L179 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2018-11-10 09:56:10,107 WARN L179 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2018-11-10 09:56:12,144 WARN L179 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2018-11-10 09:56:16,308 WARN L179 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2018-11-10 09:56:18,846 WARN L179 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2018-11-10 09:56:20,775 WARN L179 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2018-11-10 09:56:22,897 WARN L179 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2018-11-10 09:56:25,101 WARN L179 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-11-10 09:56:29,059 WARN L179 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-11-10 09:56:31,553 WARN L179 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2018-11-10 09:56:34,682 WARN L179 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 116 DAG size of output: 93 [2018-11-10 09:56:36,731 WARN L179 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2018-11-10 09:56:39,153 WARN L179 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2018-11-10 09:56:39,748 WARN L179 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2018-11-10 09:56:40,576 WARN L179 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 44 [2018-11-10 09:56:42,854 WARN L179 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2018-11-10 09:56:43,979 WARN L179 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2018-11-10 09:56:46,090 WARN L179 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-11-10 09:56:48,217 WARN L179 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2018-11-10 09:56:50,521 WARN L179 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-11-10 09:56:55,869 WARN L179 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2018-11-10 09:56:57,858 WARN L179 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2018-11-10 09:56:59,808 WARN L179 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2018-11-10 09:57:02,218 WARN L179 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2018-11-10 09:57:04,342 WARN L179 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2018-11-10 09:57:04,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:57:04,463 INFO L93 Difference]: Finished difference Result 9683 states and 10917 transitions. [2018-11-10 09:57:04,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-11-10 09:57:04,463 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 611 [2018-11-10 09:57:04,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:57:04,464 INFO L225 Difference]: With dead ends: 9683 [2018-11-10 09:57:04,464 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 09:57:04,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1381 GetRequests, 1182 SyntacticMatches, 79 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6196 ImplicationChecksByTransitivity, 80.0s TimeCoverageRelationStatistics Valid=2320, Invalid=12440, Unknown=2, NotChecked=0, Total=14762 [2018-11-10 09:57:04,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 09:57:04,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 09:57:04,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 09:57:04,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 09:57:04,473 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 611 [2018-11-10 09:57:04,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:57:04,474 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:57:04,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-10 09:57:04,474 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 09:57:04,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 09:57:04,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 09:57:05,453 WARN L179 SmtUtils]: Spent 887.00 ms on a formula simplification that was a NOOP. DAG size: 1187 [2018-11-10 09:57:08,433 WARN L179 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 1605 DAG size of output: 1604 [2018-11-10 09:57:09,324 WARN L179 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 1352 DAG size of output: 1350 [2018-11-10 09:57:12,010 WARN L179 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 1605 DAG size of output: 1604 [2018-11-10 09:57:12,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:12,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:12,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:12,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:12,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:12,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:16,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:18,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:18,131 WARN L179 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 2208 DAG size of output: 2126 [2018-11-10 09:57:18,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:18,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:18,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:18,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:18,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:18,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:19,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:19,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:19,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:19,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:19,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:19,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:19,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:19,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:19,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:19,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:19,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:19,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:19,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:19,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:23,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:24,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:24,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:24,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:24,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:24,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:24,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:25,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:57:25,424 WARN L179 SmtUtils]: Spent 7.29 s on a formula simplification. DAG size of input: 2375 DAG size of output: 2293 [2018-11-10 09:57:26,032 WARN L179 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 363 DAG size of output: 44 [2018-11-10 09:57:37,051 WARN L179 SmtUtils]: Spent 11.01 s on a formula simplification. DAG size of input: 927 DAG size of output: 73 [2018-11-10 09:58:21,759 WARN L179 SmtUtils]: Spent 44.65 s on a formula simplification. DAG size of input: 1872 DAG size of output: 211 [2018-11-10 09:58:54,617 WARN L179 SmtUtils]: Spent 32.84 s on a formula simplification. DAG size of input: 1730 DAG size of output: 124 [2018-11-10 09:59:34,742 WARN L179 SmtUtils]: Spent 40.11 s on a formula simplification. DAG size of input: 1864 DAG size of output: 124 [2018-11-10 09:59:34,744 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 09:59:34,744 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:59:34,744 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:59:34,745 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-11-10 09:59:34,745 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,745 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,745 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,745 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,745 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,745 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,745 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-11-10 09:59:34,745 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-11-10 09:59:34,745 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-10 09:59:34,745 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-10 09:59:34,745 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-10 09:59:34,745 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-10 09:59:34,745 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-10 09:59:34,745 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-10 09:59:34,745 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-11-10 09:59:34,746 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-11-10 09:59:34,746 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-11-10 09:59:34,746 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,746 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,746 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,746 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,746 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,746 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-11-10 09:59:34,746 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-11-10 09:59:34,746 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-11-10 09:59:34,746 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-11-10 09:59:34,746 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-10 09:59:34,746 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-10 09:59:34,746 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-10 09:59:34,746 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-10 09:59:34,746 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-10 09:59:34,746 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-11-10 09:59:34,747 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-11-10 09:59:34,747 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-11-10 09:59:34,747 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-11-10 09:59:34,747 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-11-10 09:59:34,747 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,747 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,747 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,747 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,747 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,747 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-11-10 09:59:34,747 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-10 09:59:34,747 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-10 09:59:34,747 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-10 09:59:34,747 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-10 09:59:34,747 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-10 09:59:34,747 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-11-10 09:59:34,748 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-11-10 09:59:34,748 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-11-10 09:59:34,748 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-11-10 09:59:34,748 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,748 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,748 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,748 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,748 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,748 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-11-10 09:59:34,748 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-11-10 09:59:34,748 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-11-10 09:59:34,748 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-10 09:59:34,748 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-10 09:59:34,748 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-10 09:59:34,748 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-10 09:59:34,748 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-10 09:59:34,749 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-11-10 09:59:34,749 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-11-10 09:59:34,749 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-11-10 09:59:34,749 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-11-10 09:59:34,749 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-11-10 09:59:34,749 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,749 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,749 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,749 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,749 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,749 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-10 09:59:34,749 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-10 09:59:34,749 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-10 09:59:34,749 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-10 09:59:34,749 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-10 09:59:34,749 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-11-10 09:59:34,749 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-11-10 09:59:34,750 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-11-10 09:59:34,750 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-11-10 09:59:34,750 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,750 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,750 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,750 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,750 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,750 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,750 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,750 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-11-10 09:59:34,750 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-11-10 09:59:34,750 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-11-10 09:59:34,750 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-11-10 09:59:34,750 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-10 09:59:34,750 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-10 09:59:34,750 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-10 09:59:34,750 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-10 09:59:34,751 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-10 09:59:34,751 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-11-10 09:59:34,751 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-11-10 09:59:34,751 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-11-10 09:59:34,751 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 199) no Hoare annotation was computed. [2018-11-10 09:59:34,751 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-11-10 09:59:34,751 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,751 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,751 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,751 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,751 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-10 09:59:34,751 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,751 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,751 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-11-10 09:59:34,751 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-11-10 09:59:34,752 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-11-10 09:59:34,752 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-10 09:59:34,752 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-10 09:59:34,752 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-10 09:59:34,752 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-10 09:59:34,752 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-10 09:59:34,752 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-10 09:59:34,752 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-11-10 09:59:34,752 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-11-10 09:59:34,752 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-11-10 09:59:34,752 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-11-10 09:59:34,752 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,752 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,752 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,752 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,752 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,753 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,753 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-11-10 09:59:34,753 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-11-10 09:59:34,753 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-11-10 09:59:34,753 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-10 09:59:34,753 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-10 09:59:34,753 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-10 09:59:34,753 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-10 09:59:34,753 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-10 09:59:34,753 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-10 09:59:34,753 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-11-10 09:59:34,753 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-11-10 09:59:34,754 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse3 (= 1 |old(~a10~0)|)) (.cse29 (= |old(~a19~0)| ~a19~0)) (.cse10 (< |old(~a10~0)| 2)) (.cse25 (<= (+ |old(~a1~0)| 13) 0)) (.cse2 (= 8 |old(~a19~0)|)) (.cse31 (= ~a1~0 |old(~a1~0)|)) (.cse30 (= ~a19~0 |old(~a19~0)|)) (.cse28 (= |old(~a10~0)| ~a10~0))) (let ((.cse6 (< 28 (* 2 ~a4~0))) (.cse5 (< (+ |old(~a19~0)| |old(~a1~0)|) 32)) (.cse18 (< |old(~a1~0)| 23)) (.cse22 (and .cse31 .cse30 .cse28)) (.cse23 (not (= 9 |old(~a19~0)|))) (.cse19 (or .cse10 (= 10 |old(~a19~0)|) .cse25 .cse2)) (.cse21 (forall ((v_prenex_202 Int)) (let ((.cse32 (mod v_prenex_202 299993))) (or (<= 0 v_prenex_202) (< (+ |old(~a1~0)| 600000) .cse32) (= 0 .cse32) (< 0 (+ v_prenex_202 13)))))) (.cse20 (and .cse28 .cse30 .cse31)) (.cse24 (and .cse29 (< 0 (+ ~a1~0 13)) .cse28)) (.cse15 (< (+ |old(~a19~0)| |old(~a10~0)|) 9)) (.cse16 (< 15 (+ ~a4~0 |old(~a10~0)|))) (.cse4 (< |old(~a19~0)| (+ ~a12~0 8))) (.cse17 (+ |old(~a1~0)| ~a12~0)) (.cse7 (< (+ ~a4~0 ~a12~0) 14)) (.cse8 (not .cse3)) (.cse9 (<= 449589 ~a1~0)) (.cse11 (< |old(~a1~0)| 449589)) (.cse12 (not (= 14 ~a4~0))) (.cse13 (not (= 0 ~a12~0))) (.cse14 (and .cse30 .cse28 .cse31)) (.cse0 (< 8 |old(~a19~0)|)) (.cse1 (and .cse29 .cse28))) (and (or .cse0 .cse1 .cse2 .cse3) (or (or (< (+ |old(~a19~0)| 30) |old(~a1~0)|) .cse4 .cse5 .cse6 .cse7) .cse8 (<= ~a1~0 (+ ~a4~0 24)) .cse0) (or .cse9 .cse10 .cse0 .cse11) (or .cse12 .cse13 (or .cse2 (not (= 2 |old(~a10~0)|))) .cse14) (or .cse15 (and (<= ~a1~0 |old(~a1~0)|) (<= |old(~a1~0)| ~a1~0)) (< |old(~a1~0)| (+ |old(~a10~0)| 23)) (< |old(~a19~0)| (+ ~inputE~0 3)) (< (+ ~inputE~0 ~inputB~0) 7) (< 10 (+ ~inputD~0 ~inputF~0)) (< ~inputF~0 (+ ~a12~0 6)) (< ~inputC~0 (+ ~inputB~0 1)) .cse16 (< (+ ~a12~0 ~inputB~0) 2) (< 441469 .cse17) .cse6 (< (+ ~a4~0 ~inputD~0) 18) (< ~a4~0 (+ |calculate_output_#in~input| 8)) (< (+ |calculate_output_#in~input| ~a12~0) 2) (< 5 (+ ~inputB~0 ~inputC~0))) (or .cse18 .cse12 .cse19 .cse13 .cse20) (or (< 4 |old(~a1~0)|) .cse12 .cse21 .cse13 .cse22 .cse23 (not (= 3 |old(~a10~0)|))) (or (or .cse15 .cse16 (< 218 .cse17) .cse4 .cse5 .cse7) .cse0 (<= ~a1~0 (+ ~a4~0 204))) (or .cse18 .cse12 .cse13 .cse23 .cse22 (not (= 0 |old(~a10~0)|))) (or .cse24 .cse0 .cse25 .cse3) (or .cse12 .cse13 (and (or .cse8 .cse25 .cse2) (or .cse8 .cse23)) .cse20) (or (let ((.cse26 (< |old(~a10~0)| 4))) (and (or .cse23 .cse26) (or .cse19 .cse26))) .cse12 .cse21 .cse20 .cse13) (or .cse0 .cse25 .cse2 .cse24) (or .cse0 (or .cse15 .cse16 .cse4 (< .cse17 24) .cse7 (< 441483 (+ ~a4~0 |old(~a1~0)|))) (and (let ((.cse27 (+ ~a1~0 ~a12~0))) (and (<= 24 .cse27) (<= 16 (* 2 ~a19~0)) (<= .cse27 441469))) (<= ~a19~0 8) .cse28)) (or .cse8 .cse9 .cse0 .cse11 .cse2) (or .cse12 .cse13 .cse14 (or (< |old(~a19~0)| 10) (< 2 |old(~a10~0)|))) (or .cse10 .cse0 .cse1)))) [2018-11-10 09:59:34,754 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-11-10 09:59:34,754 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-11-10 09:59:34,754 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-11-10 09:59:34,754 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,754 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,754 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,754 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,754 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,754 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,754 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-11-10 09:59:34,754 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-10 09:59:34,754 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-10 09:59:34,754 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-10 09:59:34,754 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-10 09:59:34,755 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-10 09:59:34,755 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-10 09:59:34,755 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-11-10 09:59:34,755 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-11-10 09:59:34,755 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-11-10 09:59:34,755 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-11-10 09:59:34,755 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-11-10 09:59:34,755 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-11-10 09:59:34,755 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,755 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,755 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,755 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,755 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,755 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,755 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-11-10 09:59:34,755 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-11-10 09:59:34,755 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-11-10 09:59:34,756 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-10 09:59:34,756 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-10 09:59:34,756 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-10 09:59:34,756 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-10 09:59:34,756 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-10 09:59:34,756 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-10 09:59:34,756 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-11-10 09:59:34,756 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-11-10 09:59:34,756 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-11-10 09:59:34,756 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,756 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,756 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,756 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,756 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,756 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 09:59:34,756 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-11-10 09:59:34,756 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-11-10 09:59:34,757 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-11-10 09:59:34,757 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-10 09:59:34,757 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-10 09:59:34,757 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-10 09:59:34,757 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-10 09:59:34,757 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-10 09:59:34,757 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-10 09:59:34,757 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-11-10 09:59:34,757 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-11-10 09:59:34,757 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-11-10 09:59:34,757 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:59:34,757 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:59:34,757 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 09:59:34,757 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 09:59:34,758 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:59:34,758 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-11-10 09:59:34,758 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse5 (not (= ~a19~0 8))) (.cse2 (< 0 (+ ~a1~0 13))) (.cse9 (<= 2 ~a10~0)) (.cse10 (not (= ~a19~0 10)))) (let ((.cse0 (and .cse9 .cse10)) (.cse1 (not (= ~a10~0 1))) (.cse4 (<= 23 ~a1~0)) (.cse7 (= 1 ~a10~0)) (.cse8 (and .cse9 .cse10 .cse5 (= 9 |old(~a19~0)|) .cse2))) (or (and (<= ~a19~0 8) .cse0) (and (= 8 ~a19~0) .cse1 .cse2) (and (exists ((v_prenex_202 Int)) (let ((.cse3 (mod v_prenex_202 299993))) (and (<= (+ v_prenex_202 13) 0) (< v_prenex_202 0) (not (= 0 .cse3)) (<= .cse3 (+ ~a1~0 600000))))) (<= ~a1~0 4) .cse0 (= 9 ~a19~0)) (= 2 ~a10~0) (and .cse4 (= 0 ~a10~0)) (and .cse5 (<= ~a10~0 2) (not (= ~a19~0 9)) .cse1) (and (let ((.cse6 (+ ~a1~0 ~a12~0))) (and (<= 24 .cse6) (<= .cse6 441469))) .cse7) (< (+ |old(~a19~0)| ~inputE~0) 14) (and .cse4 .cse8) (< (+ |old(~a1~0)| ~inputF~0) 29) (or (and .cse5 .cse7 .cse2) (and .cse7 (<= 9 ~a19~0))) (< (+ |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) (and .cse8 (<= 4 ~a10~0)) (< 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:59:34,758 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-10 09:59:34,758 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-10 09:59:34,758 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-11-10 09:59:34,758 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse5 (not (= ~a19~0 8))) (.cse2 (< 0 (+ ~a1~0 13))) (.cse9 (<= 2 ~a10~0)) (.cse10 (not (= ~a19~0 10)))) (let ((.cse0 (and .cse9 .cse10)) (.cse1 (not (= ~a10~0 1))) (.cse4 (<= 23 ~a1~0)) (.cse7 (= 1 ~a10~0)) (.cse8 (and .cse9 .cse10 .cse5 (= 9 |old(~a19~0)|) .cse2))) (or (and (<= ~a19~0 8) .cse0) (and (= 8 ~a19~0) .cse1 .cse2) (and (exists ((v_prenex_202 Int)) (let ((.cse3 (mod v_prenex_202 299993))) (and (<= (+ v_prenex_202 13) 0) (< v_prenex_202 0) (not (= 0 .cse3)) (<= .cse3 (+ ~a1~0 600000))))) (<= ~a1~0 4) .cse0 (= 9 ~a19~0)) (= 2 ~a10~0) (and .cse4 (= 0 ~a10~0)) (and .cse5 (<= ~a10~0 2) (not (= ~a19~0 9)) .cse1) (and (let ((.cse6 (+ ~a1~0 ~a12~0))) (and (<= 24 .cse6) (<= .cse6 441469))) .cse7) (< (+ |old(~a19~0)| ~inputE~0) 14) (and .cse4 .cse8) (< (+ |old(~a1~0)| ~inputF~0) 29) (or (and .cse5 .cse7 .cse2) (and .cse7 (<= 9 ~a19~0))) (< (+ |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) (and .cse8 (<= 4 ~a10~0)) (< 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:59:34,758 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-11-10 09:59:34,762 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] [2018-11-10 09:59:34,763 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] [2018-11-10 09:59:34,764 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] [2018-11-10 09:59:34,764 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] [2018-11-10 09:59:34,769 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] [2018-11-10 09:59:34,769 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] [2018-11-10 09:59:34,769 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] [2018-11-10 09:59:34,770 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] [2018-11-10 09:59:34,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:59:34 BoogieIcfgContainer [2018-11-10 09:59:34,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 09:59:34,773 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:59:34,773 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:59:34,773 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:59:34,773 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:46:12" (3/4) ... [2018-11-10 09:59:34,776 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 09:59:34,781 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 09:59:34,781 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-10 09:59:34,781 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 09:59:34,790 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 09:59:34,790 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 09:59:34,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((a19 <= 8 && 2 <= a10 && !(a19 == 10)) || ((8 == a19 && !(a10 == 1)) && 0 < a1 + 13)) || ((((\exists v_prenex_202 : int :: ((v_prenex_202 + 13 <= 0 && v_prenex_202 < 0) && !(0 == v_prenex_202 % 299993)) && v_prenex_202 % 299993 <= a1 + 600000) && a1 <= 4) && 2 <= a10 && !(a19 == 10)) && 9 == a19)) || 2 == a10) || (23 <= a1 && 0 == a10)) || (((!(a19 == 8) && a10 <= 2) && !(a19 == 9)) && !(a10 == 1))) || ((24 <= a1 + a12 && a1 + a12 <= 441469) && 1 == a10)) || \old(a19) + inputE < 14) || (23 <= a1 && (((2 <= a10 && !(a19 == 10)) && !(a19 == 8)) && 9 == \old(a19)) && 0 < a1 + 13)) || \old(a1) + inputF < 29) || ((!(a19 == 8) && 1 == a10) && 0 < a1 + 13) || (1 == a10 && 9 <= a19)) || \old(a19) + inputC < 12) || a12 + inputB < 2) || 4 < inputD + \old(a10)) || inputD < a12 + 4) || 11 < \old(a19) + inputB) || a4 + inputD < 18) || (((((2 <= a10 && !(a19 == 10)) && !(a19 == 8)) && 9 == \old(a19)) && 0 < a1 + 13) && 4 <= a10)) || 14 < a4 + \old(a10)) || 5 < inputB + inputC) || 28 < \old(a1) + inputE) || 12 < 2 * inputF) || 2 * \old(a10) < 0 [2018-11-10 09:59:34,875 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_79f0ab01-65aa-44e0-bf5a-f3c69b59c379/bin-2019/utaipan/witness.graphml [2018-11-10 09:59:34,875 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:59:34,876 INFO L168 Benchmark]: Toolchain (without parser) took 803852.92 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 957.6 MB in the beginning and 1.9 GB in the end (delta: -970.0 MB). Peak memory consumption was 379.5 MB. Max. memory is 11.5 GB. [2018-11-10 09:59:34,877 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:59:34,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.01 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 922.7 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 09:59:34,877 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 922.7 MB in the beginning and 1.1 GB in the end (delta: -196.8 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2018-11-10 09:59:34,877 INFO L168 Benchmark]: Boogie Preprocessor took 46.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-11-10 09:59:34,878 INFO L168 Benchmark]: RCFGBuilder took 1036.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.3 MB). Peak memory consumption was 110.3 MB. Max. memory is 11.5 GB. [2018-11-10 09:59:34,878 INFO L168 Benchmark]: TraceAbstraction took 802205.42 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -954.7 MB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2018-11-10 09:59:34,878 INFO L168 Benchmark]: Witness Printer took 102.47 ms. Allocated memory is still 2.4 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:59:34,880 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 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.01 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 922.7 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 115.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 922.7 MB in the beginning and 1.1 GB in the end (delta: -196.8 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1036.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.3 MB). Peak memory consumption was 110.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 802205.42 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -954.7 MB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. * Witness Printer took 102.47 ms. Allocated memory is still 2.4 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 199]: 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 [2018-11-10 09:59:34,883 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] [2018-11-10 09:59:34,883 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] [2018-11-10 09:59:34,884 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] [2018-11-10 09:59:34,884 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] [2018-11-10 09:59:34,885 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] [2018-11-10 09:59:34,885 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] [2018-11-10 09:59:34,885 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] [2018-11-10 09:59:34,885 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_202,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((a19 <= 8 && 2 <= a10 && !(a19 == 10)) || ((8 == a19 && !(a10 == 1)) && 0 < a1 + 13)) || ((((\exists v_prenex_202 : int :: ((v_prenex_202 + 13 <= 0 && v_prenex_202 < 0) && !(0 == v_prenex_202 % 299993)) && v_prenex_202 % 299993 <= a1 + 600000) && a1 <= 4) && 2 <= a10 && !(a19 == 10)) && 9 == a19)) || 2 == a10) || (23 <= a1 && 0 == a10)) || (((!(a19 == 8) && a10 <= 2) && !(a19 == 9)) && !(a10 == 1))) || ((24 <= a1 + a12 && a1 + a12 <= 441469) && 1 == a10)) || \old(a19) + inputE < 14) || (23 <= a1 && (((2 <= a10 && !(a19 == 10)) && !(a19 == 8)) && 9 == \old(a19)) && 0 < a1 + 13)) || \old(a1) + inputF < 29) || ((!(a19 == 8) && 1 == a10) && 0 < a1 + 13) || (1 == a10 && 9 <= a19)) || \old(a19) + inputC < 12) || a12 + inputB < 2) || 4 < inputD + \old(a10)) || inputD < a12 + 4) || 11 < \old(a19) + inputB) || a4 + inputD < 18) || (((((2 <= a10 && !(a19 == 10)) && !(a19 == 8)) && 9 == \old(a19)) && 0 < a1 + 13) && 4 <= a10)) || 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, 802.1s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 446.3s AutomataDifference, 0.0s DeadEndRemovalTime, 150.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 2174 SDtfs, 24075 SDslu, 3350 SDs, 0 SdLazy, 41889 SolverSat, 6688 SolverUnsat, 84 SolverUnknown, 0 SolverNotchecked, 199.7s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 5743 GetRequests, 5082 SyntacticMatches, 220 SemanticMatches, 441 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15450 ImplicationChecksByTransitivity, 222.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5113occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 148.2s AbstIntTime, 9 AbstIntIterations, 2 AbstIntStrong, 0.9952008644800405 AbsIntWeakeningRatio, 0.11403508771929824 AbsIntAvgWeakeningVarsNumRemoved, 226.60526315789474 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 3860 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 282 PreInvPairs, 494 NumberOfFragments, 1352 HoareAnnotationTreeSize, 282 FomulaSimplifications, 198548 FormulaSimplificationTreeSizeReduction, 20.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 166706 FormulaSimplificationTreeSizeReductionInter, 129.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 33.3s InterpolantComputationTime, 5829 NumberOfCodeBlocks, 5829 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 8172 ConstructedInterpolants, 337 QuantifiedInterpolants, 25927145 SizeOfPredicates, 15 NumberOfNonLiveVariables, 3744 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 27 InterpolantComputations, 8 PerfectInterpolantSequences, 8083/9914 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...