./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label49_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_fa7743e5-6dcc-4fdf-b797-8351753bdeb0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fa7743e5-6dcc-4fdf-b797-8351753bdeb0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fa7743e5-6dcc-4fdf-b797-8351753bdeb0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fa7743e5-6dcc-4fdf-b797-8351753bdeb0/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label49_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fa7743e5-6dcc-4fdf-b797-8351753bdeb0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fa7743e5-6dcc-4fdf-b797-8351753bdeb0/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 c2ee6781c62be40fa372129eaacaba9832af3ce9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:43:08,255 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:43:08,256 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:43:08,265 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:43:08,265 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:43:08,266 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:43:08,267 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:43:08,268 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:43:08,270 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:43:08,271 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:43:08,271 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:43:08,272 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:43:08,272 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:43:08,276 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:43:08,277 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:43:08,278 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:43:08,279 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:43:08,280 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:43:08,281 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:43:08,293 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:43:08,294 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:43:08,295 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:43:08,297 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:43:08,297 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:43:08,297 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:43:08,298 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:43:08,298 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:43:08,299 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:43:08,299 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:43:08,300 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:43:08,300 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:43:08,301 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:43:08,301 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:43:08,301 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:43:08,302 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:43:08,302 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:43:08,303 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fa7743e5-6dcc-4fdf-b797-8351753bdeb0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 19:43:08,314 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:43:08,314 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:43:08,314 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:43:08,315 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 19:43:08,315 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 19:43:08,315 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 19:43:08,315 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 19:43:08,315 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 19:43:08,315 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 19:43:08,316 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 19:43:08,316 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 19:43:08,316 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:43:08,316 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:43:08,317 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:43:08,317 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:43:08,317 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:43:08,317 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:43:08,317 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:43:08,319 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:43:08,319 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:43:08,319 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:43:08,320 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:43:08,320 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:43:08,320 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:43:08,320 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:43:08,320 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:43:08,320 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:43:08,321 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:43:08,321 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:43:08,321 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:43:08,321 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 19:43:08,321 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:43:08,321 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:43:08,321 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:43:08,322 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_fa7743e5-6dcc-4fdf-b797-8351753bdeb0/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 -> c2ee6781c62be40fa372129eaacaba9832af3ce9 [2018-10-26 19:43:08,348 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:43:08,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:43:08,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:43:08,364 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:43:08,364 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:43:08,365 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fa7743e5-6dcc-4fdf-b797-8351753bdeb0/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label49_true-unreach-call.c [2018-10-26 19:43:08,419 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fa7743e5-6dcc-4fdf-b797-8351753bdeb0/bin-2019/utaipan/data/daa6644f3/13634a66c576467f8ee8cee62f9a8981/FLAG91c30e690 [2018-10-26 19:43:08,853 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:43:08,854 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fa7743e5-6dcc-4fdf-b797-8351753bdeb0/sv-benchmarks/c/eca-rers2012/Problem10_label49_true-unreach-call.c [2018-10-26 19:43:08,863 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fa7743e5-6dcc-4fdf-b797-8351753bdeb0/bin-2019/utaipan/data/daa6644f3/13634a66c576467f8ee8cee62f9a8981/FLAG91c30e690 [2018-10-26 19:43:08,875 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fa7743e5-6dcc-4fdf-b797-8351753bdeb0/bin-2019/utaipan/data/daa6644f3/13634a66c576467f8ee8cee62f9a8981 [2018-10-26 19:43:08,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:43:08,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 19:43:08,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:43:08,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:43:08,884 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:43:08,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:43:08" (1/1) ... [2018-10-26 19:43:08,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a4a83f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:08, skipping insertion in model container [2018-10-26 19:43:08,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:43:08" (1/1) ... [2018-10-26 19:43:08,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:43:08,935 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:43:09,258 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:43:09,261 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:43:09,357 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:43:09,379 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:43:09,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:09 WrapperNode [2018-10-26 19:43:09,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:43:09,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:43:09,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:43:09,380 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:43:09,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:09" (1/1) ... [2018-10-26 19:43:09,401 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:09" (1/1) ... [2018-10-26 19:43:09,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:43:09,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:43:09,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:43:09,532 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:43:09,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:09" (1/1) ... [2018-10-26 19:43:09,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:09" (1/1) ... [2018-10-26 19:43:09,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:09" (1/1) ... [2018-10-26 19:43:09,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:09" (1/1) ... [2018-10-26 19:43:09,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:09" (1/1) ... [2018-10-26 19:43:09,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:09" (1/1) ... [2018-10-26 19:43:09,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:09" (1/1) ... [2018-10-26 19:43:09,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:43:09,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:43:09,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:43:09,606 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:43:09,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa7743e5-6dcc-4fdf-b797-8351753bdeb0/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:43:09,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 19:43:09,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 19:43:09,658 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-26 19:43:09,658 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-26 19:43:09,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:43:09,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:43:09,659 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 19:43:09,659 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 19:43:12,157 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:43:12,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:43:12 BoogieIcfgContainer [2018-10-26 19:43:12,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:43:12,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:43:12,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:43:12,162 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:43:12,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:43:08" (1/3) ... [2018-10-26 19:43:12,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f75035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:43:12, skipping insertion in model container [2018-10-26 19:43:12,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:09" (2/3) ... [2018-10-26 19:43:12,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f75035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:43:12, skipping insertion in model container [2018-10-26 19:43:12,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:43:12" (3/3) ... [2018-10-26 19:43:12,165 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label49_true-unreach-call.c [2018-10-26 19:43:12,175 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:43:12,183 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:43:12,197 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:43:12,225 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:43:12,225 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:43:12,225 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:43:12,225 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:43:12,226 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:43:12,234 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:43:12,234 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:43:12,234 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:43:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-10-26 19:43:12,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 19:43:12,274 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:12,275 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] [2018-10-26 19:43:12,277 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:12,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:12,284 INFO L82 PathProgramCache]: Analyzing trace with hash -654369111, now seen corresponding path program 1 times [2018-10-26 19:43:12,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:12,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:12,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:12,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:12,329 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:12,696 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-26 19:43:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:43:12,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:12,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:12,791 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:12,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:12,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:12,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:12,812 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-10-26 19:43:13,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:13,973 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-10-26 19:43:13,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:13,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-26 19:43:13,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:13,990 INFO L225 Difference]: With dead ends: 574 [2018-10-26 19:43:13,990 INFO L226 Difference]: Without dead ends: 356 [2018-10-26 19:43:13,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:14,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-26 19:43:14,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-10-26 19:43:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-26 19:43:14,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-10-26 19:43:14,054 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 29 [2018-10-26 19:43:14,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:14,055 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-10-26 19:43:14,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:14,055 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-10-26 19:43:14,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-26 19:43:14,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:14,060 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:43:14,060 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:14,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:14,061 INFO L82 PathProgramCache]: Analyzing trace with hash 350526568, now seen corresponding path program 1 times [2018-10-26 19:43:14,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:14,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:14,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:14,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:14,063 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:43:14,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:14,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 19:43:14,326 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:14,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:43:14,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:43:14,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:43:14,328 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 6 states. [2018-10-26 19:43:15,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:15,465 INFO L93 Difference]: Finished difference Result 867 states and 1507 transitions. [2018-10-26 19:43:15,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 19:43:15,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-10-26 19:43:15,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:15,469 INFO L225 Difference]: With dead ends: 867 [2018-10-26 19:43:15,469 INFO L226 Difference]: Without dead ends: 517 [2018-10-26 19:43:15,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 19:43:15,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-10-26 19:43:15,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 508. [2018-10-26 19:43:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-10-26 19:43:15,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 831 transitions. [2018-10-26 19:43:15,497 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 831 transitions. Word has length 103 [2018-10-26 19:43:15,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:15,498 INFO L481 AbstractCegarLoop]: Abstraction has 508 states and 831 transitions. [2018-10-26 19:43:15,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:43:15,498 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 831 transitions. [2018-10-26 19:43:15,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-26 19:43:15,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:15,502 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:43:15,503 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:15,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:15,503 INFO L82 PathProgramCache]: Analyzing trace with hash -781565036, now seen corresponding path program 1 times [2018-10-26 19:43:15,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:15,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:15,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:15,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:15,504 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:15,733 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:43:15,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:15,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:43:15,736 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:15,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:43:15,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:43:15,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:43:15,737 INFO L87 Difference]: Start difference. First operand 508 states and 831 transitions. Second operand 4 states. [2018-10-26 19:43:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:17,674 INFO L93 Difference]: Finished difference Result 1742 states and 2991 transitions. [2018-10-26 19:43:17,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:43:17,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-10-26 19:43:17,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:17,683 INFO L225 Difference]: With dead ends: 1742 [2018-10-26 19:43:17,684 INFO L226 Difference]: Without dead ends: 1240 [2018-10-26 19:43:17,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:43:17,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2018-10-26 19:43:17,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1240. [2018-10-26 19:43:17,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1240 states. [2018-10-26 19:43:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1869 transitions. [2018-10-26 19:43:17,743 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1869 transitions. Word has length 109 [2018-10-26 19:43:17,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:17,745 INFO L481 AbstractCegarLoop]: Abstraction has 1240 states and 1869 transitions. [2018-10-26 19:43:17,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:43:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1869 transitions. [2018-10-26 19:43:17,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-26 19:43:17,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:17,762 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:43:17,762 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:17,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:17,763 INFO L82 PathProgramCache]: Analyzing trace with hash -883752961, now seen corresponding path program 1 times [2018-10-26 19:43:17,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:17,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:17,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:17,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:17,767 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:18,142 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-26 19:43:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:43:18,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:18,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 19:43:18,584 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:18,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:43:18,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:43:18,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:43:18,585 INFO L87 Difference]: Start difference. First operand 1240 states and 1869 transitions. Second operand 6 states. [2018-10-26 19:43:19,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:19,849 INFO L93 Difference]: Finished difference Result 2759 states and 4120 transitions. [2018-10-26 19:43:19,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 19:43:19,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2018-10-26 19:43:19,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:19,863 INFO L225 Difference]: With dead ends: 2759 [2018-10-26 19:43:19,863 INFO L226 Difference]: Without dead ends: 1525 [2018-10-26 19:43:19,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 19:43:19,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2018-10-26 19:43:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1485. [2018-10-26 19:43:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2018-10-26 19:43:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 2034 transitions. [2018-10-26 19:43:19,913 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 2034 transitions. Word has length 166 [2018-10-26 19:43:19,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:19,914 INFO L481 AbstractCegarLoop]: Abstraction has 1485 states and 2034 transitions. [2018-10-26 19:43:19,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:43:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 2034 transitions. [2018-10-26 19:43:19,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-26 19:43:19,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:19,919 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:43:19,919 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:19,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:19,919 INFO L82 PathProgramCache]: Analyzing trace with hash 752941163, now seen corresponding path program 1 times [2018-10-26 19:43:19,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:19,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:19,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:19,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:19,920 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:43:20,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:20,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 19:43:20,167 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:20,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:43:20,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:43:20,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:43:20,168 INFO L87 Difference]: Start difference. First operand 1485 states and 2034 transitions. Second operand 6 states. [2018-10-26 19:43:20,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:20,894 INFO L93 Difference]: Finished difference Result 3547 states and 5008 transitions. [2018-10-26 19:43:20,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 19:43:20,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2018-10-26 19:43:20,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:20,903 INFO L225 Difference]: With dead ends: 3547 [2018-10-26 19:43:20,903 INFO L226 Difference]: Without dead ends: 2068 [2018-10-26 19:43:20,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 19:43:20,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2018-10-26 19:43:20,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2051. [2018-10-26 19:43:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2051 states. [2018-10-26 19:43:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 2708 transitions. [2018-10-26 19:43:20,954 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 2708 transitions. Word has length 172 [2018-10-26 19:43:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:20,954 INFO L481 AbstractCegarLoop]: Abstraction has 2051 states and 2708 transitions. [2018-10-26 19:43:20,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:43:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 2708 transitions. [2018-10-26 19:43:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-26 19:43:20,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:20,960 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:43:20,960 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:20,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:20,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1320084340, now seen corresponding path program 1 times [2018-10-26 19:43:20,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:20,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:20,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:20,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:20,962 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:21,258 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-26 19:43:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-26 19:43:21,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:43:21,627 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:43:21,627 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-10-26 19:43:21,629 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-26 19:43:21,687 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:43:21,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:43:23,350 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 19:43:41,654 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 19:43:41,655 INFO L272 AbstractInterpreter]: Visited 145 different actions 840 times. Merged at 5 different actions 25 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-26 19:43:41,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:41,674 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 19:43:44,348 INFO L227 lantSequenceWeakener]: Weakened 61 states. On average, predicates are now at 73.25% of their original sizes. [2018-10-26 19:43:44,348 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 19:44:08,079 INFO L415 sIntCurrentIteration]: We unified 245 AI predicates to 245 [2018-10-26 19:44:08,079 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 19:44:08,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:44:08,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [8] total 28 [2018-10-26 19:44:08,080 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:44:08,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-26 19:44:08,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-26 19:44:08,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2018-10-26 19:44:08,081 INFO L87 Difference]: Start difference. First operand 2051 states and 2708 transitions. Second operand 22 states. [2018-10-26 19:46:06,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:46:06,831 INFO L93 Difference]: Finished difference Result 5216 states and 6867 transitions. [2018-10-26 19:46:06,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-26 19:46:06,831 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 246 [2018-10-26 19:46:06,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:46:06,842 INFO L225 Difference]: With dead ends: 5216 [2018-10-26 19:46:06,842 INFO L226 Difference]: Without dead ends: 3171 [2018-10-26 19:46:06,848 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 257 GetRequests, 189 SyntacticMatches, 36 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=248, Invalid=874, Unknown=0, NotChecked=0, Total=1122 [2018-10-26 19:46:06,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2018-10-26 19:46:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 3054. [2018-10-26 19:46:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3054 states. [2018-10-26 19:46:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3054 states to 3054 states and 3798 transitions. [2018-10-26 19:46:06,968 INFO L78 Accepts]: Start accepts. Automaton has 3054 states and 3798 transitions. Word has length 246 [2018-10-26 19:46:06,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:46:06,968 INFO L481 AbstractCegarLoop]: Abstraction has 3054 states and 3798 transitions. [2018-10-26 19:46:06,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-26 19:46:06,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3054 states and 3798 transitions. [2018-10-26 19:46:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-26 19:46:06,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:46:06,977 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:46:06,977 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:46:06,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:46:06,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1863027052, now seen corresponding path program 1 times [2018-10-26 19:46:06,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:46:06,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:46:06,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:46:06,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:46:06,980 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:46:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:46:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 8 proven. 43 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-26 19:46:07,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:46:07,285 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:46:07,285 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 283 with the following transitions: [2018-10-26 19:46:07,286 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-26 19:46:07,292 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:46:07,292 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:46:08,919 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 19:46:20,130 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:46:20,130 INFO L272 AbstractInterpreter]: Visited 146 different actions 710 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-26 19:46:20,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:46:20,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:46:20,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:46:20,143 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa7743e5-6dcc-4fdf-b797-8351753bdeb0/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-10-26 19:46:20,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:46:20,151 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:46:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:46:20,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:46:20,478 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-26 19:46:20,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:46:20,910 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 19:46:21,121 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-26 19:46:21,138 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:46:21,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 11 [2018-10-26 19:46:21,138 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:46:21,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:46:21,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:46:21,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-26 19:46:21,140 INFO L87 Difference]: Start difference. First operand 3054 states and 3798 transitions. Second operand 3 states. [2018-10-26 19:46:22,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:46:22,268 INFO L93 Difference]: Finished difference Result 6598 states and 8531 transitions. [2018-10-26 19:46:22,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:46:22,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2018-10-26 19:46:22,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:46:22,283 INFO L225 Difference]: With dead ends: 6598 [2018-10-26 19:46:22,283 INFO L226 Difference]: Without dead ends: 4185 [2018-10-26 19:46:22,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 565 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-26 19:46:22,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4185 states. [2018-10-26 19:46:22,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4185 to 4185. [2018-10-26 19:46:22,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4185 states. [2018-10-26 19:46:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 5151 transitions. [2018-10-26 19:46:22,447 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 5151 transitions. Word has length 282 [2018-10-26 19:46:22,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:46:22,448 INFO L481 AbstractCegarLoop]: Abstraction has 4185 states and 5151 transitions. [2018-10-26 19:46:22,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:46:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 5151 transitions. [2018-10-26 19:46:22,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-26 19:46:22,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:46:22,457 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:46:22,457 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:46:22,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:46:22,457 INFO L82 PathProgramCache]: Analyzing trace with hash -827909397, now seen corresponding path program 1 times [2018-10-26 19:46:22,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:46:22,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:46:22,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:46:22,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:46:22,460 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:46:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:46:22,758 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-26 19:46:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 144 proven. 140 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 19:46:23,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:46:23,055 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:46:23,056 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 293 with the following transitions: [2018-10-26 19:46:23,056 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-26 19:46:23,063 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:46:23,063 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:46:25,477 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 19:46:35,143 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 19:46:35,143 INFO L272 AbstractInterpreter]: Visited 125 different actions 609 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-26 19:46:35,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:46:35,158 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 19:46:37,887 INFO L227 lantSequenceWeakener]: Weakened 28 states. On average, predicates are now at 76.79% of their original sizes. [2018-10-26 19:46:37,887 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 19:46:52,037 INFO L415 sIntCurrentIteration]: We unified 291 AI predicates to 291 [2018-10-26 19:46:52,037 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 19:46:52,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:46:52,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [13] total 32 [2018-10-26 19:46:52,038 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:46:52,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-26 19:46:52,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-26 19:46:52,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-10-26 19:46:52,039 INFO L87 Difference]: Start difference. First operand 4185 states and 5151 transitions. Second operand 21 states. [2018-10-26 19:49:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:49:45,694 INFO L93 Difference]: Finished difference Result 8499 states and 10697 transitions. [2018-10-26 19:49:45,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-26 19:49:45,694 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 292 [2018-10-26 19:49:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:49:45,707 INFO L225 Difference]: With dead ends: 8499 [2018-10-26 19:49:45,708 INFO L226 Difference]: Without dead ends: 4955 [2018-10-26 19:49:45,715 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 304 GetRequests, 247 SyntacticMatches, 25 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=202, Invalid=920, Unknown=0, NotChecked=0, Total=1122 [2018-10-26 19:49:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4955 states. [2018-10-26 19:49:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4955 to 4491. [2018-10-26 19:49:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4491 states. [2018-10-26 19:49:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4491 states to 4491 states and 5537 transitions. [2018-10-26 19:49:45,925 INFO L78 Accepts]: Start accepts. Automaton has 4491 states and 5537 transitions. Word has length 292 [2018-10-26 19:49:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:49:45,927 INFO L481 AbstractCegarLoop]: Abstraction has 4491 states and 5537 transitions. [2018-10-26 19:49:45,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-26 19:49:45,927 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 5537 transitions. [2018-10-26 19:49:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-26 19:49:45,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:49:45,937 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:49:45,937 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:49:45,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:49:45,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1466475114, now seen corresponding path program 1 times [2018-10-26 19:49:45,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:49:45,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:49:45,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:49:45,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:49:45,938 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:49:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:49:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 76 proven. 140 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-26 19:49:46,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:49:46,300 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:49:46,300 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 302 with the following transitions: [2018-10-26 19:49:46,301 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [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], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-26 19:49:46,304 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:49:46,304 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:49:46,838 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 19:50:02,406 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:50:02,406 INFO L272 AbstractInterpreter]: Visited 126 different actions 741 times. Merged at 8 different actions 44 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-26 19:50:02,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:50:02,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:50:02,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:50:02,414 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa7743e5-6dcc-4fdf-b797-8351753bdeb0/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-10-26 19:50:02,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:50:02,421 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:50:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:50:02,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:50:05,275 WARN L179 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 173 DAG size of output: 29 [2018-10-26 19:50:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 196 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-10-26 19:50:05,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:50:05,634 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 19:50:05,931 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 26 [2018-10-26 19:50:06,498 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 35 [2018-10-26 19:50:06,501 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:06,537 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:06,572 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:06,652 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:06,688 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:06,769 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:06,817 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:06,873 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:06,928 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:06,963 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:06,996 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,031 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,082 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,136 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,175 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,214 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,247 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,278 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,310 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,411 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,464 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,494 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,525 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,618 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,651 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,682 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,715 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,748 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,802 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,838 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,876 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,909 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,940 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:07,972 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:08,028 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:08,061 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:08,128 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:08,396 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:08,607 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:08,640 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:08,908 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,145 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,240 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,268 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,299 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,331 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,368 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,403 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,434 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,468 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,545 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,576 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,610 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,645 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,700 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,777 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,810 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,854 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,887 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,925 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,963 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:09,993 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:10,024 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:10,060 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:10,089 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:10,119 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:10,150 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:10,181 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:10,211 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:10,242 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:10,273 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:10,310 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:10,341 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:10,371 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:10,407 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:10,438 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:10,491 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:10,741 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:10,876 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:10,909 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:10,938 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:10,970 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,000 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,030 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,061 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,118 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,162 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,194 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,229 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,257 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,291 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,380 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,411 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,443 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,475 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,506 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,536 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,567 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,598 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,628 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,657 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,687 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:11,941 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:12,155 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:12,187 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:12,219 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:12,253 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:12,282 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-26 19:50:12,632 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 76 proven. 215 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:50:12,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 19:50:12,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 14 [2018-10-26 19:50:12,649 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 19:50:12,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 19:50:12,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 19:50:12,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-10-26 19:50:12,650 INFO L87 Difference]: Start difference. First operand 4491 states and 5537 transitions. Second operand 9 states. [2018-10-26 19:50:13,662 WARN L179 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 22 [2018-10-26 19:51:07,090 WARN L179 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-10-26 19:51:37,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:37,796 INFO L93 Difference]: Finished difference Result 14241 states and 19394 transitions. [2018-10-26 19:51:37,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-26 19:51:37,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 301 [2018-10-26 19:51:37,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:37,839 INFO L225 Difference]: With dead ends: 14241 [2018-10-26 19:51:37,844 INFO L226 Difference]: Without dead ends: 10393 [2018-10-26 19:51:37,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 500 SyntacticMatches, 111 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2018-10-26 19:51:37,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10393 states. [2018-10-26 19:51:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10393 to 10051. [2018-10-26 19:51:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10051 states. [2018-10-26 19:51:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10051 states to 10051 states and 12634 transitions. [2018-10-26 19:51:38,235 INFO L78 Accepts]: Start accepts. Automaton has 10051 states and 12634 transitions. Word has length 301 [2018-10-26 19:51:38,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:38,236 INFO L481 AbstractCegarLoop]: Abstraction has 10051 states and 12634 transitions. [2018-10-26 19:51:38,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 19:51:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 10051 states and 12634 transitions. [2018-10-26 19:51:38,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-10-26 19:51:38,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:38,258 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:38,258 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:38,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:38,259 INFO L82 PathProgramCache]: Analyzing trace with hash 293214902, now seen corresponding path program 1 times [2018-10-26 19:51:38,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:38,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:38,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:38,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:38,261 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:38,606 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 19:51:38,890 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-26 19:51:39,450 WARN L179 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-10-26 19:51:39,721 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2018-10-26 19:51:40,004 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 194 proven. 100 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 19:51:40,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:51:40,004 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:51:40,004 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 324 with the following transitions: [2018-10-26 19:51:40,004 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [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-10-26 19:51:40,008 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:51:40,008 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:51:40,957 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 19:51:58,940 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:51:58,940 INFO L272 AbstractInterpreter]: Visited 148 different actions 874 times. Merged at 8 different actions 45 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-26 19:51:58,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:58,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:51:58,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:51:58,950 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa7743e5-6dcc-4fdf-b797-8351753bdeb0/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-10-26 19:51:58,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:58,957 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:51:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:59,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:51:59,799 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 68 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:51:59,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:52:00,227 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-26 19:52:00,342 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-26 19:52:00,684 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 218 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:52:00,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 19:52:00,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 8] total 28 [2018-10-26 19:52:00,700 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 19:52:00,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-26 19:52:00,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-26 19:52:00,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2018-10-26 19:52:00,702 INFO L87 Difference]: Start difference. First operand 10051 states and 12634 transitions. Second operand 23 states. [2018-10-26 19:52:06,722 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2018-10-26 19:52:11,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:52:11,027 INFO L93 Difference]: Finished difference Result 26845 states and 39203 transitions. [2018-10-26 19:52:11,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-26 19:52:11,027 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 323 [2018-10-26 19:52:11,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:52:11,109 INFO L225 Difference]: With dead ends: 26845 [2018-10-26 19:52:11,109 INFO L226 Difference]: Without dead ends: 17154 [2018-10-26 19:52:11,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 647 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1931 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1281, Invalid=5039, Unknown=0, NotChecked=0, Total=6320 [2018-10-26 19:52:11,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states. [2018-10-26 19:52:11,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 16327. [2018-10-26 19:52:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16327 states. [2018-10-26 19:52:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16327 states to 16327 states and 21178 transitions. [2018-10-26 19:52:11,728 INFO L78 Accepts]: Start accepts. Automaton has 16327 states and 21178 transitions. Word has length 323 [2018-10-26 19:52:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:52:11,730 INFO L481 AbstractCegarLoop]: Abstraction has 16327 states and 21178 transitions. [2018-10-26 19:52:11,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-26 19:52:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 16327 states and 21178 transitions. [2018-10-26 19:52:11,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-10-26 19:52:11,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:52:11,762 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:52:11,763 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:52:11,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:52:11,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1222682881, now seen corresponding path program 1 times [2018-10-26 19:52:11,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:52:11,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:52:11,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:52:11,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:52:11,764 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:52:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:12,034 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-26 19:52:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 99 proven. 275 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-10-26 19:52:12,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:52:12,129 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:52:12,129 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 328 with the following transitions: [2018-10-26 19:52:12,129 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [506], [507], [510], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-26 19:52:12,131 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:52:12,131 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:52:12,807 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 19:52:27,869 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:52:27,869 INFO L272 AbstractInterpreter]: Visited 91 different actions 986 times. Merged at 9 different actions 104 times. Widened at 1 different actions 5 times. Found 26 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-26 19:52:27,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:52:27,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:52:27,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:52:27,889 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa7743e5-6dcc-4fdf-b797-8351753bdeb0/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-10-26 19:52:27,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:52:27,895 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:52:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:27,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:52:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 400 proven. 2 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-10-26 19:52:28,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:52:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 167 proven. 143 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2018-10-26 19:52:28,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 19:52:28,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-26 19:52:28,111 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 19:52:28,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 19:52:28,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 19:52:28,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-10-26 19:52:28,112 INFO L87 Difference]: Start difference. First operand 16327 states and 21178 transitions. Second operand 11 states. [2018-10-26 19:52:30,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:52:30,108 INFO L93 Difference]: Finished difference Result 33743 states and 45438 transitions. [2018-10-26 19:52:30,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-26 19:52:30,117 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 327 [2018-10-26 19:52:30,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:52:30,169 INFO L225 Difference]: With dead ends: 33743 [2018-10-26 19:52:30,169 INFO L226 Difference]: Without dead ends: 18059 [2018-10-26 19:52:30,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 663 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=504, Unknown=0, NotChecked=0, Total=702 [2018-10-26 19:52:30,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18059 states. [2018-10-26 19:52:30,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18059 to 17932. [2018-10-26 19:52:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17932 states. [2018-10-26 19:52:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17932 states to 17932 states and 21896 transitions. [2018-10-26 19:52:30,734 INFO L78 Accepts]: Start accepts. Automaton has 17932 states and 21896 transitions. Word has length 327 [2018-10-26 19:52:30,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:52:30,735 INFO L481 AbstractCegarLoop]: Abstraction has 17932 states and 21896 transitions. [2018-10-26 19:52:30,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 19:52:30,735 INFO L276 IsEmpty]: Start isEmpty. Operand 17932 states and 21896 transitions. [2018-10-26 19:52:30,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-10-26 19:52:30,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:52:30,783 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-26 19:52:30,783 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:52:30,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:52:30,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1976138087, now seen corresponding path program 1 times [2018-10-26 19:52:30,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:52:30,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:52:30,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:52:30,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:52:30,786 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:52:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:31,288 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 19:52:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2018-10-26 19:52:31,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:52:31,400 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:52:31,400 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 388 with the following transitions: [2018-10-26 19:52:31,400 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [133], [135], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [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-10-26 19:52:31,402 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:52:31,402 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:52:32,299 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 19:52:50,903 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:52:50,903 INFO L272 AbstractInterpreter]: Visited 127 different actions 1002 times. Merged at 9 different actions 70 times. Widened at 1 different actions 3 times. Found 18 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-26 19:52:50,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:52:50,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:52:50,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:52:50,910 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa7743e5-6dcc-4fdf-b797-8351753bdeb0/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-10-26 19:52:50,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:52:50,916 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:52:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:50,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:52:57,616 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 415 DAG size of output: 19 [2018-10-26 19:52:57,751 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2018-10-26 19:52:57,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:52:57,852 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2018-10-26 19:52:57,869 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:52:57,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 11 [2018-10-26 19:52:57,869 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:52:57,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:52:57,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:52:57,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=79, Unknown=1, NotChecked=0, Total=110 [2018-10-26 19:52:57,870 INFO L87 Difference]: Start difference. First operand 17932 states and 21896 transitions. Second operand 3 states. [2018-10-26 19:53:03,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:53:03,912 INFO L93 Difference]: Finished difference Result 35843 states and 43945 transitions. [2018-10-26 19:53:03,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:53:03,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2018-10-26 19:53:03,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:53:03,915 INFO L225 Difference]: With dead ends: 35843 [2018-10-26 19:53:03,915 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 19:53:03,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 780 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=30, Invalid=79, Unknown=1, NotChecked=0, Total=110 [2018-10-26 19:53:03,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 19:53:03,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 19:53:03,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 19:53:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 19:53:03,965 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 387 [2018-10-26 19:53:03,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:53:03,967 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 19:53:03,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:53:03,968 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 19:53:03,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 19:53:03,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 19:53:04,121 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 379 [2018-10-26 19:53:05,774 WARN L179 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 1204 DAG size of output: 1201 [2018-10-26 19:53:08,391 WARN L179 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 1450 DAG size of output: 1445 [2018-10-26 19:53:09,795 WARN L179 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 1582 DAG size of output: 1579 [2018-10-26 19:53:14,617 WARN L179 SmtUtils]: Spent 4.56 s on a formula simplification. DAG size of input: 1872 DAG size of output: 1869 [2018-10-26 19:53:14,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:14,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:14,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:14,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:14,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:14,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:14,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:17,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:17,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:18,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:18,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:18,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:18,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:20,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:21,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:21,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:21,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:21,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:21,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:21,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:21,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:22,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:22,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:22,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:22,903 WARN L179 SmtUtils]: Spent 8.28 s on a formula simplification. DAG size of input: 2332 DAG size of output: 2062 [2018-10-26 19:53:23,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:24,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:24,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:24,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:24,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:24,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:24,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:24,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:24,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:24,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:24,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:28,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:28,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:28,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:28,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:28,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:29,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:29,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:29,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:29,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:30,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:30,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:30,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:53:30,937 WARN L179 SmtUtils]: Spent 8.03 s on a formula simplification. DAG size of input: 2328 DAG size of output: 2248 [2018-10-26 19:53:31,637 WARN L179 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 379 DAG size of output: 44 [2018-10-26 19:53:44,313 WARN L179 SmtUtils]: Spent 12.67 s on a formula simplification. DAG size of input: 951 DAG size of output: 73 [2018-10-26 19:54:06,506 WARN L179 SmtUtils]: Spent 22.14 s on a formula simplification. DAG size of input: 1866 DAG size of output: 69 [2018-10-26 19:54:24,222 WARN L179 SmtUtils]: Spent 17.70 s on a formula simplification. DAG size of input: 1656 DAG size of output: 103 [2018-10-26 19:54:44,697 WARN L179 SmtUtils]: Spent 20.46 s on a formula simplification. DAG size of input: 1788 DAG size of output: 103 [2018-10-26 19:54:44,699 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-26 19:54:44,699 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a19~0)| ~a19~0) (= |old(~a10~0)| ~a10~0) (= ~a1~0 |old(~a1~0)|)) [2018-10-26 19:54:44,699 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:54:44,700 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-10-26 19:54:44,700 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,700 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,700 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,700 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,700 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,700 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,700 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-10-26 19:54:44,700 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-10-26 19:54:44,700 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-10-26 19:54:44,700 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-10-26 19:54:44,700 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-10-26 19:54:44,700 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-10-26 19:54:44,700 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-10-26 19:54:44,700 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-10-26 19:54:44,700 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-10-26 19:54:44,701 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-10-26 19:54:44,701 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-10-26 19:54:44,701 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,701 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,701 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,701 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,701 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,701 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-10-26 19:54:44,701 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-10-26 19:54:44,701 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-10-26 19:54:44,701 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-10-26 19:54:44,701 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-10-26 19:54:44,701 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-10-26 19:54:44,701 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-10-26 19:54:44,701 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-10-26 19:54:44,701 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-10-26 19:54:44,701 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-10-26 19:54:44,702 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-10-26 19:54:44,702 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-10-26 19:54:44,702 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-10-26 19:54:44,702 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-10-26 19:54:44,702 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,702 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,702 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,702 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,702 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,702 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-10-26 19:54:44,702 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-10-26 19:54:44,702 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-10-26 19:54:44,702 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-10-26 19:54:44,702 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-10-26 19:54:44,702 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-10-26 19:54:44,702 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-10-26 19:54:44,703 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-10-26 19:54:44,703 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-10-26 19:54:44,703 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-10-26 19:54:44,703 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,703 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,703 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,703 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,703 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,703 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-10-26 19:54:44,703 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-10-26 19:54:44,703 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-10-26 19:54:44,703 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-10-26 19:54:44,703 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-10-26 19:54:44,703 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-10-26 19:54:44,703 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-10-26 19:54:44,703 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-10-26 19:54:44,703 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-10-26 19:54:44,704 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-10-26 19:54:44,704 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-10-26 19:54:44,704 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-10-26 19:54:44,704 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-10-26 19:54:44,704 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,704 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,704 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,704 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,704 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,704 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-10-26 19:54:44,704 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-10-26 19:54:44,704 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-10-26 19:54:44,704 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-10-26 19:54:44,704 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-10-26 19:54:44,704 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-10-26 19:54:44,704 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-10-26 19:54:44,705 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-10-26 19:54:44,705 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-10-26 19:54:44,705 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,705 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,705 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,705 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,705 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,705 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,705 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,705 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-10-26 19:54:44,705 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-10-26 19:54:44,705 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-10-26 19:54:44,705 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-10-26 19:54:44,705 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-10-26 19:54:44,705 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-10-26 19:54:44,705 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-10-26 19:54:44,706 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-10-26 19:54:44,706 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-10-26 19:54:44,706 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-10-26 19:54:44,706 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-10-26 19:54:44,706 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-10-26 19:54:44,706 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-10-26 19:54:44,706 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,706 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,706 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,706 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,706 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-10-26 19:54:44,706 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,706 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,706 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-10-26 19:54:44,706 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-10-26 19:54:44,706 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-10-26 19:54:44,706 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-10-26 19:54:44,707 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-10-26 19:54:44,707 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-10-26 19:54:44,707 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-10-26 19:54:44,707 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-10-26 19:54:44,707 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-26 19:54:44,707 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-10-26 19:54:44,707 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-10-26 19:54:44,707 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-10-26 19:54:44,707 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-10-26 19:54:44,707 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,707 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,707 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,707 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,707 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,707 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,707 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-10-26 19:54:44,708 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-10-26 19:54:44,708 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-10-26 19:54:44,708 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-10-26 19:54:44,708 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-10-26 19:54:44,708 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-10-26 19:54:44,708 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-10-26 19:54:44,708 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-10-26 19:54:44,708 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-26 19:54:44,708 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-10-26 19:54:44,708 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-10-26 19:54:44,708 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse3 (= |old(~a19~0)| ~a19~0)) (.cse4 (= |old(~a10~0)| ~a10~0)) (.cse2 (= ~a1~0 |old(~a1~0)|))) (let ((.cse5 (= 2 |old(~a10~0)|)) (.cse6 (= 8 |old(~a19~0)|)) (.cse7 (< |old(~a1~0)| 23)) (.cse10 (forall ((v_prenex_289 Int)) (let ((.cse12 (* 9 v_prenex_289))) (let ((.cse11 (div .cse12 10))) (or (< (+ .cse11 1) 0) (< (+ (mod .cse11 25) 12) |old(~a1~0)|) (< .cse12 0) (< .cse11 0)))))) (.cse8 (= 10 |old(~a19~0)|)) (.cse0 (not (= 14 ~a4~0))) (.cse1 (not (= 0 ~a12~0))) (.cse9 (and .cse3 .cse4 .cse2))) (and (or (= 4 |old(~a10~0)|) .cse0 .cse1 (and .cse2 .cse3 .cse4) .cse5 .cse6 (< 23 |old(~a1~0)|)) (or .cse7 .cse8 .cse0 .cse1 .cse5 .cse9) (or .cse10 .cse9 .cse0 .cse1 .cse6 (not (= 0 |old(~a10~0)|))) (or .cse9 .cse8 .cse0 .cse1 .cse6) (or .cse9 (< |old(~a1~0)| 505232) .cse8 .cse0 .cse1) (or (not (= 1 |old(~a10~0)|)) .cse9 .cse7 .cse0 .cse1) (or .cse10 (< |old(~a10~0)| 2) .cse8 .cse0 .cse1 .cse9)))) [2018-10-26 19:54:44,708 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-10-26 19:54:44,709 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-10-26 19:54:44,709 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-10-26 19:54:44,709 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,709 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,709 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,709 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,709 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,709 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,709 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-10-26 19:54:44,709 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-10-26 19:54:44,709 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-10-26 19:54:44,709 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-10-26 19:54:44,709 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-10-26 19:54:44,709 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-10-26 19:54:44,709 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-26 19:54:44,709 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-10-26 19:54:44,710 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-10-26 19:54:44,710 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-10-26 19:54:44,710 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-10-26 19:54:44,710 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-10-26 19:54:44,710 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-10-26 19:54:44,710 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,710 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,710 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,710 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,710 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,710 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,710 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-10-26 19:54:44,710 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-10-26 19:54:44,710 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-10-26 19:54:44,710 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-10-26 19:54:44,710 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-10-26 19:54:44,711 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-10-26 19:54:44,711 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-10-26 19:54:44,711 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-10-26 19:54:44,711 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-10-26 19:54:44,711 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-10-26 19:54:44,711 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-10-26 19:54:44,711 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-10-26 19:54:44,711 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,711 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,711 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,711 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,711 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,711 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-10-26 19:54:44,711 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-10-26 19:54:44,711 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 70) no Hoare annotation was computed. [2018-10-26 19:54:44,711 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-10-26 19:54:44,712 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-10-26 19:54:44,712 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-10-26 19:54:44,712 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-10-26 19:54:44,712 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-10-26 19:54:44,712 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-10-26 19:54:44,712 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-10-26 19:54:44,712 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-26 19:54:44,712 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-10-26 19:54:44,712 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-10-26 19:54:44,712 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-10-26 19:54:44,712 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:54:44,712 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= (+ ~a10~0 14) ~a4~0) (<= (+ ~inputC~0 6) ~a19~0) (<= (+ ~inputB~0 2) ~inputD~0) (<= (+ ~a19~0 ~inputD~0) 13) (<= (+ ~inputF~0 17) ~a1~0) (<= 5 (+ ~a12~0 ~inputE~0)) (<= 2 (+ ~a10~0 ~inputB~0)) (<= (+ ~a12~0 5) ~inputE~0) (<= ~a4~0 (+ ~inputF~0 8)) (<= (+ ~a1~0 ~inputE~0) 28) (<= 6 (+ ~a10~0 ~inputF~0)) (<= (+ ~a10~0 3) ~inputC~0)) [2018-10-26 19:54:44,713 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 19:54:44,713 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 19:54:44,713 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (and (<= (+ ~a12~0 ~a10~0) 0) (<= 9 (+ ~a19~0 ~a10~0)) (= ~a1~0 23) (<= (+ ~a19~0 5) ~a4~0)) (< (+ |old(~a19~0)| ~inputE~0) 14) (< (+ |old(~a1~0)| ~inputF~0) 29) (< (+ |old(~a19~0)| ~inputC~0) 12) (< (+ ~a12~0 ~inputB~0) 2) (< 4 (+ ~inputD~0 |old(~a10~0)|)) (< ~inputD~0 (+ ~a12~0 4)) (< 11 (+ |old(~a19~0)| ~inputB~0)) (< (+ ~a4~0 ~inputD~0) 18) (< 14 (+ ~a4~0 |old(~a10~0)|)) (< 5 (+ ~inputB~0 ~inputC~0)) (< 28 (+ |old(~a1~0)| ~inputE~0)) (< 12 (* 2 ~inputF~0)) (< (* 2 |old(~a10~0)|) 0)) [2018-10-26 19:54:44,713 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-10-26 19:54:44,713 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse1 (exists ((v_prenex_289 Int)) (let ((.cse5 (* 9 v_prenex_289))) (let ((.cse4 (div .cse5 10))) (and (<= 0 .cse4) (<= 0 (+ .cse4 1)) (<= 0 .cse5) (<= ~a1~0 (+ (mod .cse4 25) 12))))))) (.cse0 (not (= ~a19~0 8))) (.cse3 (not (= ~a19~0 10))) (.cse2 (not (= 2 ~a10~0)))) (or (and .cse0 .cse1 (= |old(~a10~0)| ~a10~0)) (and .cse0 (<= ~a1~0 23) (not (= ~a10~0 4)) .cse2) (and .cse3 .cse0) (and .cse3 (<= 505232 ~a1~0)) (and (<= 2 ~a10~0) .cse3 .cse1) (and .cse0 (= 1 ~a10~0)) (and (<= 23 ~a1~0) .cse3 .cse2) (< (+ |old(~a19~0)| ~inputE~0) 14) (< (+ |old(~a1~0)| ~inputF~0) 29) (< (+ |old(~a19~0)| ~inputC~0) 12) (< (+ ~a12~0 ~inputB~0) 2) (< 4 (+ ~inputD~0 |old(~a10~0)|)) (< ~inputD~0 (+ ~a12~0 4)) (< 11 (+ |old(~a19~0)| ~inputB~0)) (< (+ ~a4~0 ~inputD~0) 18) (< 14 (+ ~a4~0 |old(~a10~0)|)) (< 5 (+ ~inputB~0 ~inputC~0)) (< 28 (+ |old(~a1~0)| ~inputE~0)) (< 12 (* 2 ~inputF~0)) (< (* 2 |old(~a10~0)|) 0))) [2018-10-26 19:54:44,713 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-10-26 19:54:44,713 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-10-26 19:54:44,713 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-10-26 19:54:44,714 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse1 (exists ((v_prenex_289 Int)) (let ((.cse5 (* 9 v_prenex_289))) (let ((.cse4 (div .cse5 10))) (and (<= 0 .cse4) (<= 0 (+ .cse4 1)) (<= 0 .cse5) (<= ~a1~0 (+ (mod .cse4 25) 12))))))) (.cse0 (not (= ~a19~0 8))) (.cse3 (not (= ~a19~0 10))) (.cse2 (not (= 2 ~a10~0)))) (or (and .cse0 .cse1 (= |old(~a10~0)| ~a10~0)) (and .cse0 (<= ~a1~0 23) (not (= ~a10~0 4)) .cse2) (and .cse3 .cse0) (and .cse3 (<= 505232 ~a1~0)) (and (<= 2 ~a10~0) .cse3 .cse1) (and .cse0 (= 1 ~a10~0)) (and (<= 23 ~a1~0) .cse3 .cse2) (< (+ |old(~a19~0)| ~inputE~0) 14) (< (+ |old(~a1~0)| ~inputF~0) 29) (< (+ |old(~a19~0)| ~inputC~0) 12) (< (+ ~a12~0 ~inputB~0) 2) (< 4 (+ ~inputD~0 |old(~a10~0)|)) (< ~inputD~0 (+ ~a12~0 4)) (< 11 (+ |old(~a19~0)| ~inputB~0)) (< (+ ~a4~0 ~inputD~0) 18) (< 14 (+ ~a4~0 |old(~a10~0)|)) (< 5 (+ ~inputB~0 ~inputC~0)) (< 28 (+ |old(~a1~0)| ~inputE~0)) (< 12 (* 2 ~inputF~0)) (< (* 2 |old(~a10~0)|) 0))) [2018-10-26 19:54:44,714 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-10-26 19:54:44,718 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,719 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,719 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,719 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,720 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,720 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,720 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,720 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,725 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,725 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,726 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,726 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,726 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,726 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,727 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,727 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:54:44 BoogieIcfgContainer [2018-10-26 19:54:44,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:54:44,730 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 19:54:44,730 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 19:54:44,730 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 19:54:44,731 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:43:12" (3/4) ... [2018-10-26 19:54:44,734 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 19:54:44,739 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 19:54:44,739 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-10-26 19:54:44,739 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 19:54:44,750 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-10-26 19:54:44,750 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-26 19:54:44,775 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(a19 == 8) && (\exists v_prenex_289 : int :: ((0 <= 9 * v_prenex_289 / 10 && 0 <= 9 * v_prenex_289 / 10 + 1) && 0 <= 9 * v_prenex_289) && a1 <= 9 * v_prenex_289 / 10 % 25 + 12)) && \old(a10) == a10) || (((!(a19 == 8) && a1 <= 23) && !(a10 == 4)) && !(2 == a10))) || (!(a19 == 10) && !(a19 == 8))) || (!(a19 == 10) && 505232 <= a1)) || ((2 <= a10 && !(a19 == 10)) && (\exists v_prenex_289 : int :: ((0 <= 9 * v_prenex_289 / 10 && 0 <= 9 * v_prenex_289 / 10 + 1) && 0 <= 9 * v_prenex_289) && a1 <= 9 * v_prenex_289 / 10 % 25 + 12))) || (!(a19 == 8) && 1 == a10)) || ((23 <= a1 && !(a19 == 10)) && !(2 == a10))) || \old(a19) + inputE < 14) || \old(a1) + inputF < 29) || \old(a19) + inputC < 12) || a12 + inputB < 2) || 4 < inputD + \old(a10)) || inputD < a12 + 4) || 11 < \old(a19) + inputB) || a4 + inputD < 18) || 14 < a4 + \old(a10)) || 5 < inputB + inputC) || 28 < \old(a1) + inputE) || 12 < 2 * inputF) || 2 * \old(a10) < 0 [2018-10-26 19:54:44,862 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fa7743e5-6dcc-4fdf-b797-8351753bdeb0/bin-2019/utaipan/witness.graphml [2018-10-26 19:54:44,862 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 19:54:44,863 INFO L168 Benchmark]: Toolchain (without parser) took 695984.10 ms. Allocated memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: 2.4 GB). Free memory was 957.1 MB in the beginning and 625.5 MB in the end (delta: 331.6 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-10-26 19:54:44,863 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:54:44,863 INFO L168 Benchmark]: CACSL2BoogieTranslator took 499.02 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 922.2 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-10-26 19:54:44,864 INFO L168 Benchmark]: Boogie Procedure Inliner took 150.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 922.2 MB in the beginning and 1.2 GB in the end (delta: -230.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-10-26 19:54:44,864 INFO L168 Benchmark]: Boogie Preprocessor took 74.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:54:44,864 INFO L168 Benchmark]: RCFGBuilder took 2552.03 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: 104.0 MB). Peak memory consumption was 104.0 MB. Max. memory is 11.5 GB. [2018-10-26 19:54:44,864 INFO L168 Benchmark]: TraceAbstraction took 692571.23 ms. Allocated memory was 1.2 GB in the beginning and 3.4 GB in the end (delta: 2.2 GB). Free memory was 1.0 GB in the beginning and 676.1 MB in the end (delta: 366.1 MB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. [2018-10-26 19:54:44,864 INFO L168 Benchmark]: Witness Printer took 131.86 ms. Allocated memory is still 3.4 GB. Free memory was 676.1 MB in the beginning and 625.5 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2018-10-26 19:54:44,866 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 499.02 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 922.2 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 150.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 922.2 MB in the beginning and 1.2 GB in the end (delta: -230.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2552.03 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: 104.0 MB). Peak memory consumption was 104.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 692571.23 ms. Allocated memory was 1.2 GB in the beginning and 3.4 GB in the end (delta: 2.2 GB). Free memory was 1.0 GB in the beginning and 676.1 MB in the end (delta: 366.1 MB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. * Witness Printer took 131.86 ms. Allocated memory is still 3.4 GB. Free memory was 676.1 MB in the beginning and 625.5 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 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_289,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 70]: 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-10-26 19:54:44,869 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,869 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,869 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,869 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,870 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,870 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,870 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,870 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,872 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,872 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,872 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,872 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,872 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,873 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,873 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] [2018-10-26 19:54:44,873 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_289,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((!(a19 == 8) && (\exists v_prenex_289 : int :: ((0 <= 9 * v_prenex_289 / 10 && 0 <= 9 * v_prenex_289 / 10 + 1) && 0 <= 9 * v_prenex_289) && a1 <= 9 * v_prenex_289 / 10 % 25 + 12)) && \old(a10) == a10) || (((!(a19 == 8) && a1 <= 23) && !(a10 == 4)) && !(2 == a10))) || (!(a19 == 10) && !(a19 == 8))) || (!(a19 == 10) && 505232 <= a1)) || ((2 <= a10 && !(a19 == 10)) && (\exists v_prenex_289 : int :: ((0 <= 9 * v_prenex_289 / 10 && 0 <= 9 * v_prenex_289 / 10 + 1) && 0 <= 9 * v_prenex_289) && a1 <= 9 * v_prenex_289 / 10 % 25 + 12))) || (!(a19 == 8) && 1 == a10)) || ((23 <= a1 && !(a19 == 10)) && !(2 == a10))) || \old(a19) + inputE < 14) || \old(a1) + inputF < 29) || \old(a19) + inputC < 12) || a12 + inputB < 2) || 4 < inputD + \old(a10)) || inputD < a12 + 4) || 11 < \old(a19) + inputB) || a4 + inputD < 18) || 14 < a4 + \old(a10)) || 5 < inputB + inputC) || 28 < \old(a1) + inputE) || 12 < 2 * inputF) || 2 * \old(a10) < 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 692.4s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 403.7s AutomataDifference, 0.0s DeadEndRemovalTime, 100.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1752 SDtfs, 15298 SDslu, 2312 SDs, 0 SdLazy, 26602 SolverSat, 3901 SolverUnsat, 43 SolverUnknown, 0 SolverNotchecked, 264.5s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 4028 GetRequests, 3602 SyntacticMatches, 191 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 65.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17932occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 115.3s AbstIntTime, 7 AbstIntIterations, 2 AbstIntStrong, 0.9951228909798832 AbsIntWeakeningRatio, 0.10820895522388059 AbsIntAvgWeakeningVarsNumRemoved, 525.7985074626865 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 1943 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 341 PreInvPairs, 497 NumberOfFragments, 870 HoareAnnotationTreeSize, 341 FomulaSimplifications, 375300 FormulaSimplificationTreeSizeReduction, 26.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 138739 FormulaSimplificationTreeSizeReductionInter, 73.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 25.3s InterpolantComputationTime, 4357 NumberOfCodeBlocks, 4357 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 5955 ConstructedInterpolants, 151 QuantifiedInterpolants, 10958561 SizeOfPredicates, 10 NumberOfNonLiveVariables, 2714 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 22 InterpolantComputations, 9 PerfectInterpolantSequences, 4470/5967 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...