./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_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_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label49_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9482400b4e5abae1b3b62ba7b184a5c605e6ed8f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 00:41:33,039 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 00:41:33,040 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 00:41:33,048 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 00:41:33,048 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 00:41:33,049 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 00:41:33,049 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 00:41:33,050 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 00:41:33,051 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 00:41:33,052 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 00:41:33,053 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 00:41:33,053 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 00:41:33,054 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 00:41:33,054 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 00:41:33,055 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 00:41:33,056 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 00:41:33,056 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 00:41:33,058 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 00:41:33,059 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 00:41:33,060 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 00:41:33,061 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 00:41:33,062 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 00:41:33,063 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 00:41:33,063 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 00:41:33,063 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 00:41:33,064 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 00:41:33,065 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 00:41:33,066 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 00:41:33,066 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 00:41:33,067 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 00:41:33,067 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 00:41:33,067 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 00:41:33,068 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 00:41:33,068 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 00:41:33,068 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 00:41:33,070 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 00:41:33,070 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 00:41:33,079 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 00:41:33,080 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 00:41:33,080 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 00:41:33,080 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 00:41:33,081 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 00:41:33,081 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 00:41:33,081 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 00:41:33,081 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 00:41:33,081 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 00:41:33,081 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 00:41:33,082 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 00:41:33,082 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 00:41:33,082 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 00:41:33,082 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 00:41:33,082 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 00:41:33,082 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 00:41:33,082 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 00:41:33,082 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 00:41:33,083 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 00:41:33,083 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 00:41:33,083 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 00:41:33,083 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 00:41:33,083 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 00:41:33,083 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 00:41:33,083 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 00:41:33,084 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 00:41:33,084 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 00:41:33,084 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 00:41:33,084 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 00:41:33,084 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer 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 -> Automizer 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 -> 9482400b4e5abae1b3b62ba7b184a5c605e6ed8f [2018-11-10 00:41:33,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 00:41:33,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 00:41:33,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 00:41:33,121 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 00:41:33,121 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 00:41:33,121 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label49_true-unreach-call.c [2018-11-10 00:41:33,165 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/data/86686ebeb/b6bfd6b4b3d64ff09fb1c2b3dcb41c5b/FLAGf64cd5ce0 [2018-11-10 00:41:33,597 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 00:41:33,598 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/sv-benchmarks/c/eca-rers2012/Problem15_label49_true-unreach-call.c [2018-11-10 00:41:33,612 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/data/86686ebeb/b6bfd6b4b3d64ff09fb1c2b3dcb41c5b/FLAGf64cd5ce0 [2018-11-10 00:41:33,623 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/data/86686ebeb/b6bfd6b4b3d64ff09fb1c2b3dcb41c5b [2018-11-10 00:41:33,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 00:41:33,627 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 00:41:33,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 00:41:33,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 00:41:33,631 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 00:41:33,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:41:33" (1/1) ... [2018-11-10 00:41:33,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b52ffc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:33, skipping insertion in model container [2018-11-10 00:41:33,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:41:33" (1/1) ... [2018-11-10 00:41:33,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 00:41:33,694 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 00:41:34,117 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:41:34,119 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 00:41:34,293 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:41:34,303 INFO L193 MainTranslator]: Completed translation [2018-11-10 00:41:34,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:34 WrapperNode [2018-11-10 00:41:34,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 00:41:34,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 00:41:34,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 00:41:34,304 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 00:41:34,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:34" (1/1) ... [2018-11-10 00:41:34,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:34" (1/1) ... [2018-11-10 00:41:34,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:34" (1/1) ... [2018-11-10 00:41:34,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:34" (1/1) ... [2018-11-10 00:41:34,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:34" (1/1) ... [2018-11-10 00:41:34,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:34" (1/1) ... [2018-11-10 00:41:34,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:34" (1/1) ... [2018-11-10 00:41:34,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 00:41:34,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 00:41:34,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 00:41:34,477 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 00:41:34,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 00:41:34,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 00:41:34,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 00:41:34,512 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-10 00:41:34,512 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-10 00:41:34,512 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 00:41:34,512 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-10 00:41:34,512 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-10 00:41:34,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 00:41:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 00:41:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 00:41:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 00:41:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 00:41:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 00:41:37,110 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 00:41:37,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:41:37 BoogieIcfgContainer [2018-11-10 00:41:37,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 00:41:37,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 00:41:37,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 00:41:37,115 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 00:41:37,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:41:33" (1/3) ... [2018-11-10 00:41:37,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50dd55da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:41:37, skipping insertion in model container [2018-11-10 00:41:37,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:41:34" (2/3) ... [2018-11-10 00:41:37,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50dd55da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:41:37, skipping insertion in model container [2018-11-10 00:41:37,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:41:37" (3/3) ... [2018-11-10 00:41:37,118 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label49_true-unreach-call.c [2018-11-10 00:41:37,124 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 00:41:37,129 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 00:41:37,139 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 00:41:37,163 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 00:41:37,163 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 00:41:37,163 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 00:41:37,163 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 00:41:37,164 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 00:41:37,164 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 00:41:37,164 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 00:41:37,164 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 00:41:37,164 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 00:41:37,187 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states. [2018-11-10 00:41:37,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 00:41:37,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:41:37,194 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:41:37,196 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 00:41:37,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:41:37,200 INFO L82 PathProgramCache]: Analyzing trace with hash -224629815, now seen corresponding path program 1 times [2018-11-10 00:41:37,202 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:41:37,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:41:37,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:41:37,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:41:37,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:41:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:41:37,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:41:37,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:41:37,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 00:41:37,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 00:41:37,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 00:41:37,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 00:41:37,462 INFO L87 Difference]: Start difference. First operand 438 states. Second operand 4 states. [2018-11-10 00:41:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:41:43,008 INFO L93 Difference]: Finished difference Result 1550 states and 2835 transitions. [2018-11-10 00:41:43,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 00:41:43,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-10 00:41:43,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:41:43,027 INFO L225 Difference]: With dead ends: 1550 [2018-11-10 00:41:43,027 INFO L226 Difference]: Without dead ends: 1106 [2018-11-10 00:41:43,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 00:41:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2018-11-10 00:41:43,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 762. [2018-11-10 00:41:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-11-10 00:41:43,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1263 transitions. [2018-11-10 00:41:43,101 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1263 transitions. Word has length 59 [2018-11-10 00:41:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:41:43,102 INFO L481 AbstractCegarLoop]: Abstraction has 762 states and 1263 transitions. [2018-11-10 00:41:43,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 00:41:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1263 transitions. [2018-11-10 00:41:43,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 00:41:43,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:41:43,107 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:41:43,107 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 00:41:43,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:41:43,107 INFO L82 PathProgramCache]: Analyzing trace with hash 311881044, now seen corresponding path program 1 times [2018-11-10 00:41:43,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:41:43,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:41:43,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:41:43,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:41:43,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:41:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:41:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:41:43,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:41:43,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 00:41:43,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 00:41:43,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 00:41:43,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 00:41:43,273 INFO L87 Difference]: Start difference. First operand 762 states and 1263 transitions. Second operand 5 states. [2018-11-10 00:41:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:41:46,974 INFO L93 Difference]: Finished difference Result 2245 states and 3758 transitions. [2018-11-10 00:41:46,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 00:41:46,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-11-10 00:41:46,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:41:46,987 INFO L225 Difference]: With dead ends: 2245 [2018-11-10 00:41:46,987 INFO L226 Difference]: Without dead ends: 1489 [2018-11-10 00:41:46,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 00:41:46,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2018-11-10 00:41:47,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1457. [2018-11-10 00:41:47,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2018-11-10 00:41:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 2152 transitions. [2018-11-10 00:41:47,021 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 2152 transitions. Word has length 132 [2018-11-10 00:41:47,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:41:47,022 INFO L481 AbstractCegarLoop]: Abstraction has 1457 states and 2152 transitions. [2018-11-10 00:41:47,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 00:41:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 2152 transitions. [2018-11-10 00:41:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-10 00:41:47,024 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:41:47,024 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:41:47,024 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 00:41:47,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:41:47,025 INFO L82 PathProgramCache]: Analyzing trace with hash 827365732, now seen corresponding path program 1 times [2018-11-10 00:41:47,025 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:41:47,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:41:47,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:41:47,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:41:47,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:41:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:41:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:41:47,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:41:47,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 00:41:47,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 00:41:47,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 00:41:47,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 00:41:47,137 INFO L87 Difference]: Start difference. First operand 1457 states and 2152 transitions. Second operand 4 states. [2018-11-10 00:41:51,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:41:51,673 INFO L93 Difference]: Finished difference Result 5405 states and 8310 transitions. [2018-11-10 00:41:51,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 00:41:51,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-11-10 00:41:51,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:41:51,692 INFO L225 Difference]: With dead ends: 5405 [2018-11-10 00:41:51,692 INFO L226 Difference]: Without dead ends: 3954 [2018-11-10 00:41:51,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 00:41:51,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3954 states. [2018-11-10 00:41:51,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3954 to 3951. [2018-11-10 00:41:51,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3951 states. [2018-11-10 00:41:51,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 5460 transitions. [2018-11-10 00:41:51,791 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 5460 transitions. Word has length 140 [2018-11-10 00:41:51,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:41:51,791 INFO L481 AbstractCegarLoop]: Abstraction has 3951 states and 5460 transitions. [2018-11-10 00:41:51,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 00:41:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 5460 transitions. [2018-11-10 00:41:51,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 00:41:51,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:41:51,795 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:41:51,795 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 00:41:51,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:41:51,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1388399790, now seen corresponding path program 1 times [2018-11-10 00:41:51,795 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:41:51,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:41:51,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:41:51,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:41:51,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:41:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:41:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:41:51,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:41:51,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 00:41:51,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 00:41:51,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 00:41:51,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 00:41:51,958 INFO L87 Difference]: Start difference. First operand 3951 states and 5460 transitions. Second operand 6 states. [2018-11-10 00:41:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:41:55,564 INFO L93 Difference]: Finished difference Result 9149 states and 12436 transitions. [2018-11-10 00:41:55,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 00:41:55,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2018-11-10 00:41:55,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:41:55,579 INFO L225 Difference]: With dead ends: 9149 [2018-11-10 00:41:55,579 INFO L226 Difference]: Without dead ends: 5204 [2018-11-10 00:41:55,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 00:41:55,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2018-11-10 00:41:55,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 5146. [2018-11-10 00:41:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5146 states. [2018-11-10 00:41:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5146 states to 5146 states and 6609 transitions. [2018-11-10 00:41:55,681 INFO L78 Accepts]: Start accepts. Automaton has 5146 states and 6609 transitions. Word has length 146 [2018-11-10 00:41:55,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:41:55,682 INFO L481 AbstractCegarLoop]: Abstraction has 5146 states and 6609 transitions. [2018-11-10 00:41:55,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 00:41:55,682 INFO L276 IsEmpty]: Start isEmpty. Operand 5146 states and 6609 transitions. [2018-11-10 00:41:55,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-10 00:41:55,685 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:41:55,685 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:41:55,685 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 00:41:55,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:41:55,686 INFO L82 PathProgramCache]: Analyzing trace with hash 389844774, now seen corresponding path program 1 times [2018-11-10 00:41:55,686 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:41:55,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:41:55,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:41:55,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:41:55,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:41:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:41:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:41:55,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:41:55,898 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 00:41:55,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:41:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:41:55,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:41:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:41:56,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 00:41:56,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2018-11-10 00:41:56,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 00:41:56,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 00:41:56,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 00:41:56,062 INFO L87 Difference]: Start difference. First operand 5146 states and 6609 transitions. Second operand 10 states. [2018-11-10 00:42:20,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:42:20,138 INFO L93 Difference]: Finished difference Result 21747 states and 29247 transitions. [2018-11-10 00:42:20,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-10 00:42:20,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 171 [2018-11-10 00:42:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:42:20,191 INFO L225 Difference]: With dead ends: 21747 [2018-11-10 00:42:20,192 INFO L226 Difference]: Without dead ends: 16607 [2018-11-10 00:42:20,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=1078, Unknown=0, NotChecked=0, Total=1332 [2018-11-10 00:42:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16607 states. [2018-11-10 00:42:20,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16607 to 15747. [2018-11-10 00:42:20,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15747 states. [2018-11-10 00:42:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15747 states to 15747 states and 20273 transitions. [2018-11-10 00:42:20,515 INFO L78 Accepts]: Start accepts. Automaton has 15747 states and 20273 transitions. Word has length 171 [2018-11-10 00:42:20,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:42:20,515 INFO L481 AbstractCegarLoop]: Abstraction has 15747 states and 20273 transitions. [2018-11-10 00:42:20,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 00:42:20,515 INFO L276 IsEmpty]: Start isEmpty. Operand 15747 states and 20273 transitions. [2018-11-10 00:42:20,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-10 00:42:20,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:42:20,519 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2018-11-10 00:42:20,519 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 00:42:20,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:42:20,520 INFO L82 PathProgramCache]: Analyzing trace with hash 626819489, now seen corresponding path program 1 times [2018-11-10 00:42:20,520 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:42:20,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:42:20,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:42:20,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:42:20,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:42:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:42:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-10 00:42:20,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:42:20,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 00:42:20,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 00:42:20,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 00:42:20,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 00:42:20,670 INFO L87 Difference]: Start difference. First operand 15747 states and 20273 transitions. Second operand 4 states. [2018-11-10 00:42:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:42:23,551 INFO L93 Difference]: Finished difference Result 59460 states and 78910 transitions. [2018-11-10 00:42:23,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 00:42:23,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2018-11-10 00:42:23,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:42:23,619 INFO L225 Difference]: With dead ends: 59460 [2018-11-10 00:42:23,619 INFO L226 Difference]: Without dead ends: 28964 [2018-11-10 00:42:23,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 00:42:23,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28964 states. [2018-11-10 00:42:24,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28964 to 28524. [2018-11-10 00:42:24,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28524 states. [2018-11-10 00:42:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28524 states to 28524 states and 33826 transitions. [2018-11-10 00:42:24,067 INFO L78 Accepts]: Start accepts. Automaton has 28524 states and 33826 transitions. Word has length 217 [2018-11-10 00:42:24,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:42:24,068 INFO L481 AbstractCegarLoop]: Abstraction has 28524 states and 33826 transitions. [2018-11-10 00:42:24,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 00:42:24,068 INFO L276 IsEmpty]: Start isEmpty. Operand 28524 states and 33826 transitions. [2018-11-10 00:42:24,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-10 00:42:24,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:42:24,072 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:42:24,072 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 00:42:24,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:42:24,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1137314364, now seen corresponding path program 1 times [2018-11-10 00:42:24,073 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:42:24,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:42:24,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:42:24,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:42:24,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:42:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:42:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 104 proven. 76 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 00:42:24,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:42:24,356 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 00:42:24,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:42:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:42:24,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:42:24,540 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-10 00:42:24,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 00:42:24,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-11-10 00:42:24,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 00:42:24,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 00:42:24,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 00:42:24,558 INFO L87 Difference]: Start difference. First operand 28524 states and 33826 transitions. Second operand 9 states. [2018-11-10 00:42:35,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:42:35,022 INFO L93 Difference]: Finished difference Result 63680 states and 76228 transitions. [2018-11-10 00:42:35,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 00:42:35,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 247 [2018-11-10 00:42:35,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:42:35,092 INFO L225 Difference]: With dead ends: 63680 [2018-11-10 00:42:35,092 INFO L226 Difference]: Without dead ends: 35162 [2018-11-10 00:42:35,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 250 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-11-10 00:42:35,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35162 states. [2018-11-10 00:42:35,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35162 to 32832. [2018-11-10 00:42:35,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32832 states. [2018-11-10 00:42:35,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32832 states to 32832 states and 38494 transitions. [2018-11-10 00:42:35,474 INFO L78 Accepts]: Start accepts. Automaton has 32832 states and 38494 transitions. Word has length 247 [2018-11-10 00:42:35,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:42:35,474 INFO L481 AbstractCegarLoop]: Abstraction has 32832 states and 38494 transitions. [2018-11-10 00:42:35,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 00:42:35,475 INFO L276 IsEmpty]: Start isEmpty. Operand 32832 states and 38494 transitions. [2018-11-10 00:42:35,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2018-11-10 00:42:35,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:42:35,492 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:42:35,492 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 00:42:35,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:42:35,493 INFO L82 PathProgramCache]: Analyzing trace with hash 805382823, now seen corresponding path program 1 times [2018-11-10 00:42:35,493 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:42:35,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:42:35,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:42:35,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:42:35,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:42:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:42:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 166 proven. 245 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 00:42:36,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:42:36,135 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 00:42:36,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:42:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:42:36,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:42:36,357 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 370 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-10 00:42:36,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 00:42:36,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2018-11-10 00:42:36,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 00:42:36,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 00:42:36,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-10 00:42:36,375 INFO L87 Difference]: Start difference. First operand 32832 states and 38494 transitions. Second operand 13 states. [2018-11-10 00:42:42,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:42:42,311 INFO L93 Difference]: Finished difference Result 86731 states and 106223 transitions. [2018-11-10 00:42:42,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 00:42:42,311 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 485 [2018-11-10 00:42:42,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:42:42,430 INFO L225 Difference]: With dead ends: 86731 [2018-11-10 00:42:42,430 INFO L226 Difference]: Without dead ends: 54214 [2018-11-10 00:42:42,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 505 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=317, Invalid=943, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 00:42:42,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54214 states. [2018-11-10 00:42:43,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54214 to 52546. [2018-11-10 00:42:43,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52546 states. [2018-11-10 00:42:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52546 states to 52546 states and 60662 transitions. [2018-11-10 00:42:43,126 INFO L78 Accepts]: Start accepts. Automaton has 52546 states and 60662 transitions. Word has length 485 [2018-11-10 00:42:43,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:42:43,126 INFO L481 AbstractCegarLoop]: Abstraction has 52546 states and 60662 transitions. [2018-11-10 00:42:43,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 00:42:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 52546 states and 60662 transitions. [2018-11-10 00:42:43,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2018-11-10 00:42:43,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:42:43,133 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 00:42:43,134 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 00:42:43,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:42:43,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1363112432, now seen corresponding path program 1 times [2018-11-10 00:42:43,134 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:42:43,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:42:43,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:42:43,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:42:43,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:42:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:42:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-10 00:42:43,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:42:43,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:42:43,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 00:42:43,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:42:43,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:42:43,407 INFO L87 Difference]: Start difference. First operand 52546 states and 60662 transitions. Second operand 3 states. [2018-11-10 00:42:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:42:44,726 INFO L93 Difference]: Finished difference Result 105104 states and 122497 transitions. [2018-11-10 00:42:44,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:42:44,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 498 [2018-11-10 00:42:44,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:42:44,821 INFO L225 Difference]: With dead ends: 105104 [2018-11-10 00:42:44,821 INFO L226 Difference]: Without dead ends: 52564 [2018-11-10 00:42:45,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:42:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52564 states. [2018-11-10 00:42:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52564 to 52369. [2018-11-10 00:42:45,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52369 states. [2018-11-10 00:42:45,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52369 states to 52369 states and 59880 transitions. [2018-11-10 00:42:45,547 INFO L78 Accepts]: Start accepts. Automaton has 52369 states and 59880 transitions. Word has length 498 [2018-11-10 00:42:45,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:42:45,547 INFO L481 AbstractCegarLoop]: Abstraction has 52369 states and 59880 transitions. [2018-11-10 00:42:45,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 00:42:45,547 INFO L276 IsEmpty]: Start isEmpty. Operand 52369 states and 59880 transitions. [2018-11-10 00:42:45,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2018-11-10 00:42:45,554 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:42:45,554 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:42:45,554 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 00:42:45,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:42:45,555 INFO L82 PathProgramCache]: Analyzing trace with hash 41196208, now seen corresponding path program 1 times [2018-11-10 00:42:45,555 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:42:45,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:42:45,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:42:45,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:42:45,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:42:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:42:46,652 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 59 proven. 471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:42:46,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:42:46,653 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 00:42:46,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:42:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:42:46,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:42:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-11-10 00:42:47,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 00:42:47,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [15] total 16 [2018-11-10 00:42:47,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 00:42:47,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 00:42:47,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-11-10 00:42:47,390 INFO L87 Difference]: Start difference. First operand 52369 states and 59880 transitions. Second operand 16 states. [2018-11-10 00:43:21,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:43:21,186 INFO L93 Difference]: Finished difference Result 123423 states and 144166 transitions. [2018-11-10 00:43:21,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-10 00:43:21,187 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 596 [2018-11-10 00:43:21,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:43:21,294 INFO L225 Difference]: With dead ends: 123423 [2018-11-10 00:43:21,294 INFO L226 Difference]: Without dead ends: 71368 [2018-11-10 00:43:21,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 644 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=3252, Unknown=0, NotChecked=0, Total=4032 [2018-11-10 00:43:21,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71368 states. [2018-11-10 00:43:21,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71368 to 64154. [2018-11-10 00:43:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64154 states. [2018-11-10 00:43:21,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64154 states to 64154 states and 71643 transitions. [2018-11-10 00:43:21,973 INFO L78 Accepts]: Start accepts. Automaton has 64154 states and 71643 transitions. Word has length 596 [2018-11-10 00:43:21,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:43:21,974 INFO L481 AbstractCegarLoop]: Abstraction has 64154 states and 71643 transitions. [2018-11-10 00:43:21,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 00:43:21,974 INFO L276 IsEmpty]: Start isEmpty. Operand 64154 states and 71643 transitions. [2018-11-10 00:43:21,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2018-11-10 00:43:21,982 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:43:21,983 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:43:21,983 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 00:43:21,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:43:21,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1043202644, now seen corresponding path program 1 times [2018-11-10 00:43:21,984 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:43:21,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:43:21,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:43:21,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:43:21,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:43:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:43:22,348 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 459 proven. 50 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-11-10 00:43:22,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:43:22,348 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 00:43:22,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:43:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:43:22,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:43:22,744 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 34 [2018-11-10 00:43:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 477 proven. 191 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-11-10 00:43:24,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 00:43:24,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 14 [2018-11-10 00:43:24,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 00:43:24,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 00:43:24,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=146, Unknown=2, NotChecked=0, Total=182 [2018-11-10 00:43:24,257 INFO L87 Difference]: Start difference. First operand 64154 states and 71643 transitions. Second operand 14 states. [2018-11-10 00:43:35,518 WARN L179 SmtUtils]: Spent 541.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-10 00:45:19,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:45:19,249 INFO L93 Difference]: Finished difference Result 153792 states and 172090 transitions. [2018-11-10 00:45:19,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-10 00:45:19,249 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 728 [2018-11-10 00:45:19,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:45:19,403 INFO L225 Difference]: With dead ends: 153792 [2018-11-10 00:45:19,403 INFO L226 Difference]: Without dead ends: 90262 [2018-11-10 00:45:19,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 771 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1506 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=799, Invalid=3485, Unknown=6, NotChecked=0, Total=4290 [2018-11-10 00:45:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90262 states. [2018-11-10 00:45:20,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90262 to 82524. [2018-11-10 00:45:20,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82524 states. [2018-11-10 00:45:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82524 states to 82524 states and 91845 transitions. [2018-11-10 00:45:20,436 INFO L78 Accepts]: Start accepts. Automaton has 82524 states and 91845 transitions. Word has length 728 [2018-11-10 00:45:20,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:45:20,437 INFO L481 AbstractCegarLoop]: Abstraction has 82524 states and 91845 transitions. [2018-11-10 00:45:20,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 00:45:20,437 INFO L276 IsEmpty]: Start isEmpty. Operand 82524 states and 91845 transitions. [2018-11-10 00:45:20,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 921 [2018-11-10 00:45:20,459 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:45:20,460 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:45:20,460 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 00:45:20,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:45:20,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1901707798, now seen corresponding path program 1 times [2018-11-10 00:45:20,461 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:45:20,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:45:20,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:45:20,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:45:20,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:45:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:45:20,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1502 backedges. 629 proven. 2 refuted. 0 times theorem prover too weak. 871 trivial. 0 not checked. [2018-11-10 00:45:20,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:45:20,930 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 00:45:20,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:45:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:45:21,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:45:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1502 backedges. 629 proven. 2 refuted. 0 times theorem prover too weak. 871 trivial. 0 not checked. [2018-11-10 00:45:21,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 00:45:21,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-10 00:45:21,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 00:45:21,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 00:45:21,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-10 00:45:21,565 INFO L87 Difference]: Start difference. First operand 82524 states and 91845 transitions. Second operand 9 states. [2018-11-10 00:45:25,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:45:25,333 INFO L93 Difference]: Finished difference Result 159693 states and 179203 transitions. [2018-11-10 00:45:25,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 00:45:25,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 920 [2018-11-10 00:45:25,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:45:25,486 INFO L225 Difference]: With dead ends: 159693 [2018-11-10 00:45:25,486 INFO L226 Difference]: Without dead ends: 77793 [2018-11-10 00:45:25,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 947 GetRequests, 929 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2018-11-10 00:45:25,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77793 states. [2018-11-10 00:45:26,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77793 to 74720. [2018-11-10 00:45:26,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74720 states. [2018-11-10 00:45:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74720 states to 74720 states and 80387 transitions. [2018-11-10 00:45:26,385 INFO L78 Accepts]: Start accepts. Automaton has 74720 states and 80387 transitions. Word has length 920 [2018-11-10 00:45:26,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:45:26,386 INFO L481 AbstractCegarLoop]: Abstraction has 74720 states and 80387 transitions. [2018-11-10 00:45:26,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 00:45:26,386 INFO L276 IsEmpty]: Start isEmpty. Operand 74720 states and 80387 transitions. [2018-11-10 00:45:26,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1023 [2018-11-10 00:45:26,418 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:45:26,419 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:45:26,419 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 00:45:26,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:45:26,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1284854701, now seen corresponding path program 1 times [2018-11-10 00:45:26,419 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:45:26,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:45:26,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:45:26,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:45:26,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:45:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:45:28,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1686 backedges. 284 proven. 2 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-11-10 00:45:28,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:45:28,109 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 00:45:28,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:45:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:45:28,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:45:28,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1686 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 1044 trivial. 0 not checked. [2018-11-10 00:45:28,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 00:45:28,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-11-10 00:45:28,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 00:45:28,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:45:28,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:45:28,576 INFO L87 Difference]: Start difference. First operand 74720 states and 80387 transitions. Second operand 3 states. [2018-11-10 00:45:30,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:45:30,147 INFO L93 Difference]: Finished difference Result 148056 states and 160029 transitions. [2018-11-10 00:45:30,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:45:30,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1022 [2018-11-10 00:45:30,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:45:30,267 INFO L225 Difference]: With dead ends: 148056 [2018-11-10 00:45:30,267 INFO L226 Difference]: Without dead ends: 80367 [2018-11-10 00:45:30,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1024 GetRequests, 1023 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:45:30,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80367 states. [2018-11-10 00:45:30,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80367 to 77028. [2018-11-10 00:45:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77028 states. [2018-11-10 00:45:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77028 states to 77028 states and 82166 transitions. [2018-11-10 00:45:31,051 INFO L78 Accepts]: Start accepts. Automaton has 77028 states and 82166 transitions. Word has length 1022 [2018-11-10 00:45:31,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:45:31,052 INFO L481 AbstractCegarLoop]: Abstraction has 77028 states and 82166 transitions. [2018-11-10 00:45:31,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 00:45:31,052 INFO L276 IsEmpty]: Start isEmpty. Operand 77028 states and 82166 transitions. [2018-11-10 00:45:31,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1172 [2018-11-10 00:45:31,102 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:45:31,103 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:45:31,103 INFO L424 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 00:45:31,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:45:31,103 INFO L82 PathProgramCache]: Analyzing trace with hash -189249340, now seen corresponding path program 1 times [2018-11-10 00:45:31,103 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:45:31,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:45:31,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:45:31,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:45:31,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:45:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:45:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2815 backedges. 416 proven. 4 refuted. 0 times theorem prover too weak. 2395 trivial. 0 not checked. [2018-11-10 00:45:31,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:45:31,797 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 00:45:31,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:45:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:45:31,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:45:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2815 backedges. 1303 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2018-11-10 00:45:32,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 00:45:32,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-11-10 00:45:32,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 00:45:32,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:45:32,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:45:32,313 INFO L87 Difference]: Start difference. First operand 77028 states and 82166 transitions. Second operand 3 states. [2018-11-10 00:45:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:45:33,819 INFO L93 Difference]: Finished difference Result 156446 states and 167408 transitions. [2018-11-10 00:45:33,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:45:33,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1171 [2018-11-10 00:45:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:45:33,920 INFO L225 Difference]: With dead ends: 156446 [2018-11-10 00:45:33,921 INFO L226 Difference]: Without dead ends: 68738 [2018-11-10 00:45:34,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1173 GetRequests, 1172 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:45:34,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68738 states. [2018-11-10 00:45:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68738 to 65021. [2018-11-10 00:45:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65021 states. [2018-11-10 00:45:34,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65021 states to 65021 states and 68726 transitions. [2018-11-10 00:45:34,907 INFO L78 Accepts]: Start accepts. Automaton has 65021 states and 68726 transitions. Word has length 1171 [2018-11-10 00:45:34,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:45:34,908 INFO L481 AbstractCegarLoop]: Abstraction has 65021 states and 68726 transitions. [2018-11-10 00:45:34,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 00:45:34,908 INFO L276 IsEmpty]: Start isEmpty. Operand 65021 states and 68726 transitions. [2018-11-10 00:45:34,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1300 [2018-11-10 00:45:34,947 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 00:45:34,948 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:45:34,948 INFO L424 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 00:45:34,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:45:34,949 INFO L82 PathProgramCache]: Analyzing trace with hash 587041182, now seen corresponding path program 1 times [2018-11-10 00:45:34,949 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:45:34,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:45:34,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:45:34,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:45:34,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:45:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:45:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2899 backedges. 1178 proven. 162 refuted. 0 times theorem prover too weak. 1559 trivial. 0 not checked. [2018-11-10 00:45:35,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 00:45:35,831 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 00:45:35,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:45:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:45:35,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:45:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2899 backedges. 905 proven. 2 refuted. 0 times theorem prover too weak. 1992 trivial. 0 not checked. [2018-11-10 00:45:36,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 00:45:36,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-10 00:45:36,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 00:45:36,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 00:45:36,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 00:45:36,719 INFO L87 Difference]: Start difference. First operand 65021 states and 68726 transitions. Second operand 9 states. [2018-11-10 00:46:09,267 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-11-10 00:46:56,073 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-11-10 00:47:05,869 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-11-10 00:47:25,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:47:25,316 INFO L93 Difference]: Finished difference Result 100871 states and 106794 transitions. [2018-11-10 00:47:25,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 00:47:25,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1299 [2018-11-10 00:47:25,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 00:47:25,317 INFO L225 Difference]: With dead ends: 100871 [2018-11-10 00:47:25,317 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 00:47:25,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1339 GetRequests, 1315 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2018-11-10 00:47:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 00:47:25,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 00:47:25,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 00:47:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 00:47:25,387 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1299 [2018-11-10 00:47:25,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 00:47:25,388 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 00:47:25,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 00:47:25,388 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 00:47:25,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 00:47:25,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 00:47:25,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:25,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:25,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:25,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:25,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:25,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:25,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:25,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:25,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:25,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:25,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:25,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:25,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:25,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:25,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:26,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:26,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:26,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:26,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:26,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:26,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:26,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:26,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:26,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:26,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:26,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:26,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:26,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:26,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:26,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:26,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:26,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:26,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:26,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:27,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:27,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:27,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:27,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:27,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:27,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:27,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:27,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:27,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:27,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:27,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:27,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:27,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:27,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:27,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:27,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:27,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:27,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:27,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:27,909 WARN L179 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 862 DAG size of output: 708 [2018-11-10 00:47:27,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:28,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:29,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:29,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:29,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:29,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:29,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:29,292 WARN L179 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 862 DAG size of output: 708 [2018-11-10 00:47:29,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:29,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:29,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:29,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:29,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:29,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:30,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:30,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:30,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:30,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:30,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:30,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:30,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:30,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:47:30,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 00:48:24,671 WARN L179 SmtUtils]: Spent 54.03 s on a formula simplification. DAG size of input: 1100 DAG size of output: 253 [2018-11-10 00:49:03,449 WARN L179 SmtUtils]: Spent 38.73 s on a formula simplification. DAG size of input: 827 DAG size of output: 233 [2018-11-10 00:49:29,944 WARN L179 SmtUtils]: Spent 26.48 s on a formula simplification. DAG size of input: 712 DAG size of output: 141 [2018-11-10 00:49:49,128 WARN L179 SmtUtils]: Spent 19.18 s on a formula simplification. DAG size of input: 712 DAG size of output: 141 [2018-11-10 00:50:44,858 WARN L179 SmtUtils]: Spent 55.69 s on a formula simplification. DAG size of input: 1011 DAG size of output: 267 [2018-11-10 00:50:44,861 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 00:50:44,861 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a2~0)| ~a2~0) (= ~a29~0 |old(~a29~0)|) (= ~a4~0 |old(~a4~0)|)) [2018-11-10 00:50:44,861 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 00:50:44,861 INFO L425 ceAbstractionStarter]: For program point calculate_output2EXIT(lines 1658 1758) no Hoare annotation was computed. [2018-11-10 00:50:44,861 INFO L425 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2018-11-10 00:50:44,861 INFO L425 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L421 ceAbstractionStarter]: At program point calculate_output2ENTRY(lines 1658 1758) the Hoare annotation is: (let ((.cse52 (+ |old(~a4~0)| 89)) (.cse43 (+ ~a0~0 61)) (.cse44 (+ |old(~a0~0)| 61)) (.cse46 (= 4 |old(~a2~0)|)) (.cse45 (= 3 |old(~a2~0)|))) (let ((.cse37 (< (+ |old(~a4~0)| 74) 0)) (.cse24 (< 0 (+ |old(~a0~0)| 99))) (.cse19 (not .cse45)) (.cse10 (<= (+ |old(~a4~0)| 86) 0)) (.cse27 (< 0 (+ |old(~a0~0)| 98))) (.cse33 (< 0 (+ |old(~a29~0)| 16))) (.cse36 (not .cse46)) (.cse16 (< 0 .cse44)) (.cse47 (= 1 |old(~a2~0)|)) (.cse35 (= |old(~a2~0)| ~a2~0)) (.cse8 (= 1 ~a2~0)) (.cse22 (<= .cse43 0)) (.cse40 (< .cse52 0)) (.cse23 (< 0 .cse52)) (.cse4 (= ~a29~0 |old(~a29~0)|)) (.cse32 (<= (+ ~a0~0 147) 0)) (.cse29 (= 4 ~a2~0)) (.cse48 (<= (+ ~a4~0 89) 0)) (.cse49 (not (= ~a2~0 4))) (.cse9 (= ~a4~0 |old(~a4~0)|))) (let ((.cse20 (and .cse48 .cse49 .cse9)) (.cse39 (= 5 ~a2~0)) (.cse38 (and .cse4 .cse32 .cse29 .cse9)) (.cse21 (= 3 ~a2~0)) (.cse6 (forall ((v_prenex_2 Int)) (let ((.cse51 (+ (* 4 (div v_prenex_2 5)) 4))) (let ((.cse50 (mod .cse51 299978))) (or (<= 0 v_prenex_2) (< |old(~a29~0)| (+ .cse50 43)) (= (mod v_prenex_2 5) 0) (<= 0 .cse51) (= 0 .cse50)))))) (.cse18 (or .cse23 .cse46)) (.cse41 (or .cse23 .cse40)) (.cse5 (and .cse48 .cse35 .cse49 (not (= ~a2~0 3)) .cse9 (or (not .cse8) (< 0 (+ ~a29~0 144)) .cse22))) (.cse7 (or .cse23 .cse45 (and .cse16 .cse47 (<= (+ |old(~a29~0)| 144) 0)) .cse46)) (.cse30 (or .cse36 .cse23)) (.cse12 (forall ((v_~a29~0_907 Int)) (or (< (+ (mod v_~a29~0_907 29) 14) |old(~a29~0)|) (< v_~a29~0_907 0)))) (.cse42 (and .cse4 .cse32 .cse35 .cse9)) (.cse2 (not (= 5 |old(~a2~0)|))) (.cse1 (< (+ |old(~a0~0)| 60) 0)) (.cse11 (not .cse47)) (.cse14 (or .cse23 .cse45 .cse33 .cse46)) (.cse3 (<= 0 (+ ~a0~0 60))) (.cse25 (<= (+ ~a0~0 99) 0)) (.cse0 (< 599999 |old(~a29~0)|)) (.cse17 (and .cse10 (<= |old(~a29~0)| 43) .cse27 (<= .cse44 0) .cse33)) (.cse15 (not (= 2 |old(~a2~0)|))) (.cse28 (<= (+ ~a0~0 98) 0)) (.cse13 (= ~a2~0 2)) (.cse31 (< 0 (+ |old(~a0~0)| 147))) (.cse26 (< (+ |old(~a29~0)| 13) 0)) (.cse34 (or .cse37 .cse24 .cse19))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5) .cse6 .cse7) (or (and .cse4 .cse8 .cse9) (or .cse10 .cse11) .cse12) (or (and .cse4 (and .cse13 .cse9)) (or .cse14 .cse15)) (or .cse16 .cse0 .cse17 .cse18 .cse19 (and .cse20 .cse4 .cse21 .cse22)) (or .cse16 (and .cse4 .cse8 .cse9 .cse22) (or .cse0 .cse23 .cse11)) (or .cse18 .cse24 .cse25) (or .cse10 .cse26 .cse12 .cse15 .cse27 (and .cse28 .cse4 .cse13 .cse9)) (or (and (and .cse4 .cse29 .cse9) .cse28) .cse30 .cse27) (or .cse0 .cse31 .cse26 .cse19 (and .cse4 .cse32 .cse21 .cse9)) (or .cse10 .cse11 .cse28 .cse33 .cse27) (or .cse34 (and .cse4 (and .cse25 .cse21 .cse9))) (or .cse24 .cse25 .cse30) (or .cse10 .cse11 .cse22 .cse33 .cse16) (or .cse10 (and .cse28 .cse4 .cse35 .cse9) .cse26 .cse2 .cse12 .cse27) (or .cse0 (or .cse36 .cse37 .cse24) .cse26 .cse25) (or (or .cse0 .cse10 .cse36 .cse31 .cse6) .cse38) (or .cse10 (and .cse4 .cse25 .cse39 .cse9) .cse33 .cse2 .cse24) (or .cse0 .cse1 .cse40 .cse6 .cse3 .cse23 .cse15) (or .cse16 .cse23 (and .cse4 .cse13 .cse22 .cse9) .cse15) (or (or .cse1 .cse41) .cse2 .cse3 .cse12) (or .cse0 .cse36 (and .cse28 .cse4 .cse29 .cse9) .cse26 .cse37 .cse27) (or .cse0 .cse1 (and .cse3 .cse4 .cse21 .cse20) .cse18 .cse19) (or .cse10 .cse2 .cse24 .cse6 .cse25) (or .cse16 .cse0 .cse2 .cse7 (and .cse4 .cse39 .cse9 .cse22)) (or .cse10 .cse2 (and .cse28 .cse4 .cse39 .cse9) .cse27 .cse6) (or .cse10 .cse36 .cse31 .cse33 .cse38) (or (or .cse10 .cse19 .cse33) .cse31 (and (and .cse21 .cse9) .cse4 .cse32)) (or .cse0 .cse31 .cse2 .cse6 .cse42) (or .cse18 (and .cse35 .cse28 .cse4 .cse9) .cse27) (or (or .cse10 .cse31 .cse15) (and .cse4 .cse32 .cse13 .cse9)) (or .cse0 .cse10 .cse11 .cse31 .cse26 (and .cse4 .cse32 .cse8 .cse9)) (or (or .cse10 .cse11 .cse24 .cse33) .cse25) (or .cse1 (forall ((v_prenex_14 Int)) (or (< (* 4 (div (+ (mod v_prenex_14 299978) 300022) 5)) (+ |old(~a29~0)| 587483)) (<= v_prenex_14 43) (< v_prenex_14 0))) .cse41 .cse15 .cse3) (or (and .cse4 .cse5) (or .cse2 .cse7) .cse12) (or .cse1 (and .cse3 .cse4 (and .cse29 .cse9)) .cse30 .cse12) (or .cse42 .cse31 .cse10 .cse2) (or .cse16 (or .cse36 .cse23 .cse33) (and .cse4 .cse29 .cse9 .cse22)) (or .cse32 (or .cse11 .cse37 .cse33) .cse31) (or .cse1 .cse11 .cse14 (and .cse3 .cse9 .cse4 .cse8)) (or .cse10 .cse26 (and .cse4 .cse25 .cse13 .cse9) .cse24 .cse15) (or .cse26 (or .cse0 .cse23 .cse17 .cse15) (and (or .cse28 (< 0 .cse43) (< 43 ~a29~0)) .cse4 .cse13 .cse9)) (or .cse31 .cse26 .cse32 .cse34))))) [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point calculate_output2FINAL(lines 1658 1758) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L168(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L102(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L36(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,862 INFO L425 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L171(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L105(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L39(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,863 INFO L425 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,864 INFO L425 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,864 INFO L425 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,864 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,864 INFO L425 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,864 INFO L425 ceAbstractionStarter]: For program point L174(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,864 INFO L425 ceAbstractionStarter]: For program point L108(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,864 INFO L425 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2018-11-10 00:50:44,864 INFO L425 ceAbstractionStarter]: For program point L42(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,864 INFO L425 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2018-11-10 00:50:44,864 INFO L425 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,864 INFO L425 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,864 INFO L425 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,864 INFO L425 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2018-11-10 00:50:44,864 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,864 INFO L425 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2018-11-10 00:50:44,865 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-10 00:50:44,865 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-10 00:50:44,865 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-10 00:50:44,865 INFO L425 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,865 INFO L425 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,865 INFO L425 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,865 INFO L425 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,865 INFO L425 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,865 INFO L425 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,865 INFO L425 ceAbstractionStarter]: For program point L177(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,865 INFO L425 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,865 INFO L425 ceAbstractionStarter]: For program point L111(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,865 INFO L425 ceAbstractionStarter]: For program point L45(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,865 INFO L425 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,866 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-10 00:50:44,866 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-10 00:50:44,866 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-10 00:50:44,866 INFO L425 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,866 INFO L425 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,866 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2018-11-10 00:50:44,866 INFO L425 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,866 INFO L425 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2018-11-10 00:50:44,866 INFO L425 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,866 INFO L425 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,866 INFO L425 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,866 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2018-11-10 00:50:44,866 INFO L425 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2018-11-10 00:50:44,866 INFO L425 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,866 INFO L425 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,867 INFO L425 ceAbstractionStarter]: For program point L180(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,867 INFO L425 ceAbstractionStarter]: For program point L114(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,867 INFO L425 ceAbstractionStarter]: For program point L48(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,867 INFO L425 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,867 INFO L425 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,867 INFO L425 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,867 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,867 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-10 00:50:44,867 INFO L425 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,867 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-10 00:50:44,867 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-10 00:50:44,867 INFO L425 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,867 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,867 INFO L425 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,867 INFO L425 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,868 INFO L425 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,868 INFO L425 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,868 INFO L425 ceAbstractionStarter]: For program point L183(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,868 INFO L425 ceAbstractionStarter]: For program point L117(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,868 INFO L425 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,868 INFO L425 ceAbstractionStarter]: For program point L51(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,868 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,868 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,868 INFO L425 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2018-11-10 00:50:44,868 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,868 INFO L425 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2018-11-10 00:50:44,868 INFO L425 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2018-11-10 00:50:44,868 INFO L425 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2018-11-10 00:50:44,868 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-10 00:50:44,868 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L186(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L120(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L54(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,869 INFO L425 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,870 INFO L425 ceAbstractionStarter]: For program point L189(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,870 INFO L425 ceAbstractionStarter]: For program point L123(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,870 INFO L425 ceAbstractionStarter]: For program point L57(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,870 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,870 INFO L425 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,870 INFO L425 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,870 INFO L425 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,870 INFO L425 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,870 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-10 00:50:44,870 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-10 00:50:44,870 INFO L425 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,870 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-10 00:50:44,870 INFO L425 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,870 INFO L425 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,870 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,870 INFO L425 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2018-11-10 00:50:44,870 INFO L425 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2018-11-10 00:50:44,870 INFO L425 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2018-11-10 00:50:44,870 INFO L425 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2018-11-10 00:50:44,870 INFO L425 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,871 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 23 1656) the Hoare annotation is: (let ((.cse38 (= 1 ~a2~0)) (.cse8 (< (+ |old(~a4~0)| 74) 0)) (.cse32 (not (= 3 |old(~a2~0)|))) (.cse39 (+ |old(~a4~0)| 89)) (.cse34 (<= (+ ~a0~0 99) 0)) (.cse28 (= 2 ~a2~0)) (.cse1 (<= (+ |old(~a4~0)| 86) 0)) (.cse35 (< 0 (+ |old(~a0~0)| 99))) (.cse12 (not (= 2 |old(~a2~0)|))) (.cse37 (= 4 ~a2~0)) (.cse15 (= ~a29~0 |old(~a29~0)|)) (.cse7 (<= (+ ~a0~0 147) 0)) (.cse36 (= |old(~a2~0)| ~a2~0)) (.cse17 (= ~a4~0 |old(~a4~0)|))) (let ((.cse10 (and .cse15 .cse7 .cse36 .cse17)) (.cse16 (= ~a2~0 2)) (.cse14 (<= (+ ~a0~0 98) 0)) (.cse13 (< 0 (+ |old(~a0~0)| 98))) (.cse25 (and .cse15 .cse7 .cse37 .cse17)) (.cse19 (or (or .cse1 .cse35) .cse12)) (.cse18 (and .cse36 .cse15 (< 0 (+ ~a4~0 86)) .cse34 .cse28 .cse17)) (.cse27 (= 5 ~a2~0)) (.cse11 (not (= 5 |old(~a2~0)|))) (.cse24 (forall ((v_prenex_2 Int)) (let ((.cse41 (+ (* 4 (div v_prenex_2 5)) 4))) (let ((.cse40 (mod .cse41 299978))) (or (<= 0 v_prenex_2) (< |old(~a29~0)| (+ .cse40 43)) (= (mod v_prenex_2 5) 0) (<= 0 .cse41) (= 0 .cse40)))))) (.cse5 (< 0 (+ |old(~a0~0)| 147))) (.cse6 (< (+ |old(~a29~0)| 13) 0)) (.cse31 (< .cse39 0)) (.cse4 (or .cse8 .cse35 .cse32)) (.cse3 (forall ((v_~a29~0_907 Int)) (or (< (+ (mod v_~a29~0_907 29) 14) |old(~a29~0)|) (< v_~a29~0_907 0)))) (.cse21 (< 0 (+ |old(~a0~0)| 61))) (.cse23 (not (= 4 |old(~a2~0)|))) (.cse20 (<= (+ ~a0~0 61) 0)) (.cse22 (< 599999 |old(~a29~0)|)) (.cse29 (<= 0 (+ ~a0~0 60))) (.cse33 (= 3 ~a2~0)) (.cse30 (< (+ |old(~a0~0)| 60) 0)) (.cse0 (and .cse15 .cse38 .cse17)) (.cse26 (< 0 .cse39)) (.cse2 (not (= 1 |old(~a2~0)|))) (.cse9 (< 0 (+ |old(~a29~0)| 16)))) (and (or .cse0 (or .cse1 .cse2) .cse3) (or .cse4 .cse5 .cse6 .cse7) (or .cse7 .cse5 (or .cse2 .cse8 .cse9)) (or .cse10 .cse1 .cse5 .cse11) (or .cse1 .cse6 .cse3 .cse12 .cse13 (and .cse14 .cse15 .cse16 .cse17)) (or .cse1 .cse2 .cse14 .cse9 .cse13) (or .cse18 .cse6 .cse19) (or .cse1 .cse2 .cse20 .cse9 .cse21) (or (or .cse22 .cse1 .cse23 .cse5 .cse24) .cse25) (or .cse21 .cse22 .cse26 .cse11 (and .cse15 .cse27 .cse20 .cse17)) (or (and .cse15 (and .cse28 .cse17)) .cse6 (or .cse22 .cse26 .cse12)) (or .cse29 (or .cse30 .cse26 .cse31) .cse11 .cse3) (or .cse5 (or (or .cse1 .cse9) .cse32) (and .cse7 (and .cse15 .cse17 .cse33))) (or .cse21 .cse26 (and .cse15 .cse16 .cse20 .cse17) .cse12) (or .cse30 .cse2 (not (= 0 (+ |old(~a29~0)| 127))) .cse31 .cse29 .cse26) (or .cse22 .cse6 .cse34 (or .cse23 .cse8 .cse35)) (or .cse1 .cse11 .cse35 (and .cse15 .cse34 .cse27 .cse17) .cse9) (or .cse26 (and .cse36 .cse14 .cse15 .cse17) .cse13) (or .cse22 .cse23 (and .cse14 .cse15 .cse37 .cse17) .cse6 .cse8 .cse13) (or .cse21 .cse22 .cse26 (and .cse15 .cse33 .cse20 .cse17) (and (<= |old(~a29~0)| 43) .cse9) .cse32) (or .cse22 .cse10 .cse5 .cse11 .cse24) (or .cse21 .cse22 .cse26 (and .cse15 .cse38 .cse20 .cse17) .cse2) (or .cse22 .cse30 .cse26 .cse11 (and .cse15 .cse36 .cse29 .cse17) .cse24) (or .cse22 (and .cse15 .cse7 .cse17 .cse33) .cse5 .cse6 .cse32) (or .cse1 .cse11 .cse35 .cse24 .cse34) (or .cse1 .cse11 (and .cse14 .cse15 .cse27 .cse17) .cse13 .cse24) (or .cse26 .cse35 .cse34) (or (and (and .cse16 .cse17) .cse15) (or (or .cse26 .cse12) .cse9)) (or .cse1 (and .cse14 .cse15 .cse36 .cse17) .cse11 .cse6 .cse3 .cse13) (or .cse1 .cse23 .cse5 .cse9 .cse25) (or (or .cse5 .cse19) (and .cse18 .cse7)) (or (and .cse15 .cse27 .cse17) .cse3 (or .cse26 .cse11)) (or .cse22 (or .cse30 .cse26 .cse31 .cse12 .cse24) .cse29) (or .cse22 .cse1 .cse2 .cse5 .cse6 (and .cse15 .cse7 .cse38 .cse17)) (or .cse30 (forall ((v_prenex_14 Int)) (or (< (* 4 (div (+ (mod v_prenex_14 299978) 300022) 5)) (+ |old(~a29~0)| 587483)) (<= v_prenex_14 43) (< v_prenex_14 0))) .cse31 .cse29 .cse26 .cse12) (or .cse4 (and .cse15 .cse34 .cse33 .cse17)) (or .cse34 (or .cse1 .cse2 .cse35 .cse9)) (or .cse30 .cse23 .cse26 (and .cse29 .cse15 .cse37 .cse17) .cse3) (or .cse21 .cse23 .cse26 (and .cse15 .cse20 .cse37 .cse17) .cse9) (or .cse22 (and .cse15 .cse29 .cse33 .cse17) (or .cse30 .cse26 .cse32)) (or .cse0 (or .cse26 .cse2 .cse9))))) [2018-11-10 00:50:44,871 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,871 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,871 INFO L425 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,871 INFO L425 ceAbstractionStarter]: For program point L192(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,871 INFO L425 ceAbstractionStarter]: For program point L126(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,871 INFO L425 ceAbstractionStarter]: For program point L60(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,871 INFO L425 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,871 INFO L425 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,871 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2018-11-10 00:50:44,871 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2018-11-10 00:50:44,871 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-10 00:50:44,871 INFO L425 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,871 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-10 00:50:44,871 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-10 00:50:44,871 INFO L425 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,871 INFO L425 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,871 INFO L425 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L195(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L129(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L63(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L198(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L132(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,872 INFO L425 ceAbstractionStarter]: For program point L66(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,873 INFO L425 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,873 INFO L425 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,873 INFO L425 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2018-11-10 00:50:44,873 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,873 INFO L425 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2018-11-10 00:50:44,873 INFO L425 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,873 INFO L425 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2018-11-10 00:50:44,873 INFO L425 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2018-11-10 00:50:44,873 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-10 00:50:44,873 INFO L425 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,873 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-10 00:50:44,873 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-10 00:50:44,873 INFO L425 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,873 INFO L425 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2018-11-10 00:50:44,874 INFO L425 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2018-11-10 00:50:44,874 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,874 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2018-11-10 00:50:44,874 INFO L425 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2018-11-10 00:50:44,874 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,874 INFO L425 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,874 INFO L425 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,874 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,874 INFO L425 ceAbstractionStarter]: For program point L201(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,874 INFO L425 ceAbstractionStarter]: For program point L135(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,874 INFO L425 ceAbstractionStarter]: For program point L69(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,874 INFO L425 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,875 INFO L421 ceAbstractionStarter]: At program point L1655(line 1655) the Hoare annotation is: (let ((.cse54 (+ ~a4~0 89))) (let ((.cse46 (<= .cse54 0)) (.cse42 (= |old(~a2~0)| ~a2~0)) (.cse12 (= ~a29~0 |old(~a29~0)|)) (.cse28 (= 4 ~a2~0)) (.cse14 (= ~a4~0 |old(~a4~0)|))) (let ((.cse43 (= 4 |old(~a2~0)|)) (.cse38 (and .cse46 .cse42 .cse12 .cse28 .cse14)) (.cse50 (+ ~a0~0 61)) (.cse1 (<= (+ |old(~a4~0)| 86) 0)) (.cse22 (< 0 (+ |old(~a0~0)| 99))) (.cse9 (not (= 2 |old(~a2~0)|))) (.cse7 (< 0 (+ |old(~a29~0)| 16))) (.cse45 (+ |old(~a4~0)| 89)) (.cse4 (<= (+ ~a0~0 147) 0)) (.cse44 (= 1 ~a2~0)) (.cse11 (<= (+ ~a0~0 98) 0)) (.cse47 (not (= ~a2~0 4))) (.cse53 (<= 0 .cse54)) (.cse48 (not (= ~a2~0 3))) (.cse49 (<= (+ ~a29~0 16) 0))) (let ((.cse25 (= 3 ~a2~0)) (.cse18 (and .cse46 .cse42 .cse11 .cse47 .cse53 .cse12 .cse48 .cse49 .cse14)) (.cse20 (and .cse42 .cse14)) (.cse3 (forall ((v_~a29~0_907 Int)) (or (< (+ (mod v_~a29~0_907 29) 14) |old(~a29~0)|) (< v_~a29~0_907 0)))) (.cse0 (and .cse12 .cse44 .cse14)) (.cse33 (and .cse12 .cse4 .cse28 .cse14)) (.cse26 (= 5 ~a2~0)) (.cse41 (and .cse46 .cse42 .cse11 .cse47 .cse12 .cse14)) (.cse40 (and .cse46 .cse42 .cse12 .cse14)) (.cse21 (not (= 5 |old(~a2~0)|))) (.cse19 (<= 0 (+ ~a0~0 60))) (.cse15 (< (+ |old(~a0~0)| 60) 0)) (.cse16 (< .cse45 0)) (.cse39 (and (or .cse7 (<= (+ |old(~a29~0)| 144) 0)) .cse46 .cse42 .cse11 .cse47 .cse53 .cse12 .cse48 .cse14)) (.cse34 (or (or .cse1 .cse22) .cse9)) (.cse8 (< (+ |old(~a29~0)| 13) 0)) (.cse31 (< 599999 |old(~a29~0)|)) (.cse36 (< 0 .cse50)) (.cse13 (= ~a2~0 2)) (.cse5 (< 0 (+ |old(~a0~0)| 147))) (.cse6 (< (+ |old(~a4~0)| 74) 0)) (.cse32 (forall ((v_prenex_2 Int)) (let ((.cse52 (+ (* 4 (div v_prenex_2 5)) 4))) (let ((.cse51 (mod .cse52 299978))) (or (<= 0 v_prenex_2) (< |old(~a29~0)| (+ .cse51 43)) (= (mod v_prenex_2 5) 0) (<= 0 .cse52) (= 0 .cse51)))))) (.cse23 (not (= 3 |old(~a2~0)|))) (.cse24 (<= (+ ~a0~0 99) 0)) (.cse29 (<= .cse50 0)) (.cse30 (< 0 (+ |old(~a0~0)| 61))) (.cse2 (not (= 1 |old(~a2~0)|))) (.cse35 (and .cse46 .cse42 .cse47 .cse12 .cse48 .cse49 .cse14)) (.cse37 (and .cse38 .cse11)) (.cse27 (not .cse43)) (.cse17 (< 0 .cse45)) (.cse10 (< 0 (+ |old(~a0~0)| 98)))) (and (or .cse0 (or .cse1 .cse2) .cse3) (or .cse4 .cse5 (or .cse2 .cse6 .cse7)) (or .cse1 .cse8 .cse3 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14)) (or .cse15 (forall ((v_prenex_14 Int)) (or (< (* 4 (div (+ (mod v_prenex_14 299978) 300022) 5)) (+ |old(~a29~0)| 587483)) (<= v_prenex_14 43) (< v_prenex_14 0))) .cse16 .cse17 .cse18 .cse9 .cse19) (or .cse1 .cse2 .cse11 .cse7 .cse10) (or (and .cse12 .cse20) .cse3 (or .cse17 .cse21)) (or (or .cse6 .cse22 .cse23) (and .cse12 (and .cse24 .cse25 .cse14))) (or .cse1 .cse5 .cse21 (and .cse12 .cse4 .cse26 .cse14)) (or (or .cse27 .cse17 .cse7) (and (and .cse28 .cse14) .cse12)) (or .cse1 .cse2 .cse29 .cse7 .cse30) (or (or .cse31 .cse1 .cse27 .cse5 .cse32) .cse33) (or (and .cse12 .cse24 .cse13 .cse14) .cse8 .cse34) (or .cse31 .cse5 .cse8 (and .cse12 .cse4 .cse25 .cse14) .cse23) (or .cse5 (or (or .cse1 .cse7) .cse23) (and (and .cse25 .cse14) .cse12 .cse4)) (or (or (or .cse17 .cse9) .cse7) .cse35) (or (or .cse17 .cse23 (< 0 (+ |old(~a29~0)| 107484))) (or .cse11 .cse36)) (or .cse1 .cse21 .cse22 (and .cse12 .cse24 .cse26 .cse14) .cse7) (or .cse31 .cse8 .cse24 (or .cse27 .cse6 .cse22)) (or .cse15 .cse27 .cse37 .cse17 .cse3 (and .cse19 .cse38)) (or (or .cse15 .cse17 .cse16) .cse21 .cse18 .cse19 .cse39 .cse3) (or .cse31 (and .cse40 .cse19) (or .cse15 .cse17 .cse23) .cse41) (or .cse31 .cse27 (and .cse11 .cse12 .cse28 .cse14) .cse8 .cse6 .cse10) (or .cse31 .cse15 .cse32 .cse17 .cse21 (and .cse19 .cse12 .cse20) (and .cse42 .cse11 .cse12 .cse14)) (or .cse1 .cse21 .cse22 .cse32 .cse24) (or .cse1 .cse21 (and .cse11 .cse12 .cse26 .cse14) .cse10 .cse32) (or .cse15 .cse2 (not (= 0 (+ |old(~a29~0)| 127))) .cse16 .cse19 .cse11 .cse17) (or .cse17 .cse22 .cse24) (or .cse1 (and .cse11 .cse12 .cse42 .cse14) .cse21 .cse8 .cse3 .cse10) (or .cse31 .cse2 .cse30 .cse17 (and .cse0 .cse29)) (or .cse1 .cse27 .cse5 .cse7 .cse33) (or .cse31 (and .cse12 .cse26 .cse14 .cse29) .cse30 .cse17 .cse21) (or .cse17 .cse41 .cse43 .cse10) (or .cse30 .cse27 .cse17 .cse29 .cse7) (or .cse31 .cse30 .cse17 (and (<= |old(~a29~0)| 43) .cse7) (and .cse40 .cse29) .cse23) (or .cse31 .cse5 .cse21 .cse32 (and .cse12 .cse4 .cse42 .cse14)) (or .cse31 .cse19 (or .cse15 .cse17 .cse16 .cse9 .cse32) .cse39) (or (or .cse5 .cse34) (and .cse12 .cse4 .cse13 .cse14)) (or .cse31 .cse1 .cse2 .cse5 .cse8 (and .cse12 .cse4 .cse44 .cse14)) (or .cse8 (or .cse31 .cse17 .cse9) (and (or .cse11 .cse36 (< 43 ~a29~0)) .cse12 .cse13 .cse14)) (or .cse5 .cse4 (or .cse6 .cse32 .cse23)) (or .cse24 (or .cse1 .cse2 .cse22 .cse7)) (or (and .cse29 (and .cse42 .cse12 .cse14)) .cse30 .cse17 .cse9) (or (or .cse17 .cse2 .cse7) .cse35) (or .cse37 .cse27 .cse17 .cse10)))))) [2018-11-10 00:50:44,875 INFO L425 ceAbstractionStarter]: For program point L1655-1(line 1655) no Hoare annotation was computed. [2018-11-10 00:50:44,875 INFO L425 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,875 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-10 00:50:44,875 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-10 00:50:44,875 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-10 00:50:44,875 INFO L425 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,875 INFO L425 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,875 INFO L425 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,875 INFO L425 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,875 INFO L425 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,875 INFO L425 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,875 INFO L425 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,875 INFO L425 ceAbstractionStarter]: For program point L204(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,875 INFO L425 ceAbstractionStarter]: For program point L138(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,875 INFO L425 ceAbstractionStarter]: For program point L72(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,875 INFO L425 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2018-11-10 00:50:44,875 INFO L425 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2018-11-10 00:50:44,875 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,876 INFO L425 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,876 INFO L425 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-11-10 00:50:44,876 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-10 00:50:44,876 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-10 00:50:44,876 INFO L425 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,876 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,876 INFO L425 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,876 INFO L425 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2018-11-10 00:50:44,876 INFO L425 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2018-11-10 00:50:44,876 INFO L425 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,876 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,876 INFO L425 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,876 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,876 INFO L425 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,876 INFO L425 ceAbstractionStarter]: For program point L141(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,877 INFO L425 ceAbstractionStarter]: For program point L75(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,877 INFO L425 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,877 INFO L425 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,877 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-10 00:50:44,877 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-10 00:50:44,877 INFO L425 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,877 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,877 INFO L425 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,877 INFO L425 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,877 INFO L425 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,877 INFO L425 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,877 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,877 INFO L425 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2018-11-10 00:50:44,877 INFO L425 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,877 INFO L425 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2018-11-10 00:50:44,878 INFO L425 ceAbstractionStarter]: For program point L144(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,878 INFO L425 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2018-11-10 00:50:44,878 INFO L425 ceAbstractionStarter]: For program point L78(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,878 INFO L425 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2018-11-10 00:50:44,878 INFO L425 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,878 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-10 00:50:44,878 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-10 00:50:44,878 INFO L425 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,878 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,878 INFO L425 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,878 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,878 INFO L425 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,878 INFO L425 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,878 INFO L425 ceAbstractionStarter]: For program point L147(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,878 INFO L425 ceAbstractionStarter]: For program point L81(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,879 INFO L425 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,879 INFO L425 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,879 INFO L425 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,879 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,879 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-10 00:50:44,879 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-10 00:50:44,879 INFO L425 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,879 INFO L425 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,879 INFO L425 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,879 INFO L425 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,879 INFO L425 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,879 INFO L425 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,879 INFO L425 ceAbstractionStarter]: For program point L150(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,879 INFO L425 ceAbstractionStarter]: For program point L84(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,879 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,880 INFO L425 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,880 INFO L425 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,880 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2018-11-10 00:50:44,880 INFO L425 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2018-11-10 00:50:44,880 INFO L425 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,880 INFO L425 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,880 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-10 00:50:44,880 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-10 00:50:44,880 INFO L425 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,880 INFO L425 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,880 INFO L425 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,880 INFO L425 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,880 INFO L425 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,880 INFO L425 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,880 INFO L425 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,880 INFO L425 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L153(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L87(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L156(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L90(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,881 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 163) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L159(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L93(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L27(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-10 00:50:44,882 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L96(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L30(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,883 INFO L425 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L165(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L99(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L33(lines 23 1656) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,884 INFO L425 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2018-11-10 00:50:44,885 INFO L425 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2018-11-10 00:50:44,885 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 00:50:44,885 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (+ ~a4~0 89))) (and (<= .cse0 0) (<= 0 .cse0) (<= 0 (+ ~a0~0 60)) (= 1 ~a2~0) (= (+ ~a29~0 127) 0))) [2018-11-10 00:50:44,885 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 00:50:44,885 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 00:50:44,885 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 1760 1776) the Hoare annotation is: (let ((.cse0 (+ |old(~a4~0)| 89))) (or (< (+ |old(~a0~0)| 60) 0) (not (= 1 |old(~a2~0)|)) (not (= 0 (+ |old(~a29~0)| 127))) (< .cse0 0) (and (<= 0 (+ ~a0~0 60)) (= 1 ~a2~0) (= ~a4~0 |old(~a4~0)|) (= (+ ~a29~0 127) 0)) (< 0 .cse0))) [2018-11-10 00:50:44,885 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 1760 1776) no Hoare annotation was computed. [2018-11-10 00:50:44,885 INFO L421 ceAbstractionStarter]: At program point L1774(line 1774) the Hoare annotation is: (let ((.cse19 (+ ~a29~0 16)) (.cse5 (<= ~a29~0 599999)) (.cse0 (< 0 (+ ~a4~0 86))) (.cse17 (<= (+ ~a0~0 99) 0)) (.cse13 (= ~a2~0 2)) (.cse14 (+ ~a0~0 61))) (let ((.cse7 (<= (+ ~a0~0 98) 0)) (.cse3 (<= .cse14 0)) (.cse11 (exists ((v_prenex_2 Int)) (let ((.cse21 (+ (* 4 (div v_prenex_2 5)) 4))) (let ((.cse22 (mod .cse21 299978))) (and (< .cse21 0) (not (= (mod v_prenex_2 5) 0)) (< v_prenex_2 0) (not (= 0 .cse22)) (<= (+ .cse22 43) ~a29~0)))))) (.cse6 (= 1 ~a2~0)) (.cse8 (<= 0 (+ ~a4~0 74))) (.cse16 (= 3 ~a2~0)) (.cse9 (<= 0 (+ ~a29~0 13))) (.cse20 (and .cse5 (and .cse0 .cse17 .cse13) (<= |old(~a2~0)| 2))) (.cse2 (= 5 ~a2~0)) (.cse12 (exists ((v_~a29~0_907 Int)) (and (<= 0 v_~a29~0_907) (<= ~a29~0 (+ (mod v_~a29~0_907 29) 14))))) (.cse4 (<= (+ ~a4~0 89) 0)) (.cse1 (<= (+ ~a0~0 147) 0)) (.cse15 (<= .cse19 0)) (.cse10 (= 4 ~a2~0)) (.cse18 (+ |old(~a4~0)| 89))) (or (and .cse0 .cse1 .cse2) (and .cse3 (and .cse4 .cse5 .cse6)) (and .cse7 .cse5 .cse8 .cse9 .cse10) (and .cse7 .cse0 .cse2 .cse11) (and .cse5 .cse0 .cse6 .cse1) (and .cse12 .cse7 .cse0 .cse2 .cse9) (and .cse4 .cse5 .cse2 .cse3) (not (= 1 |old(~a2~0)|)) (and .cse12 .cse7 .cse0 .cse13 .cse9) (and (or (< 0 .cse14) .cse15 (< 43 ~a29~0)) .cse4 .cse5 .cse16) (and .cse4 .cse7) (and .cse0 .cse17 .cse13 .cse11) (and .cse5 .cse1 .cse2 .cse11) (and .cse6 (and .cse4 .cse15)) (not (= 0 (+ |old(~a29~0)| 127))) (and (and .cse4 .cse5 (= 2 ~a2~0)) .cse9) (and .cse12 (and .cse4 .cse2)) (and .cse1 (and .cse5 .cse16) .cse9) (and .cse5 .cse0 .cse1 .cse11 .cse10) (and .cse4 .cse13 .cse3) (and .cse0 .cse6 .cse15 .cse3) (and .cse4 .cse5 .cse2 .cse11) (and .cse1 (and .cse0 .cse15 .cse16)) (< .cse18 0) (and (and .cse4 .cse13) .cse15) (and .cse12 .cse0 .cse6 (or (= ~a29~0 |old(~a29~0)|) (< 0 .cse19))) (and .cse1 .cse20) (and .cse17 .cse8 .cse16) (< (+ |old(~a0~0)| 60) 0) (and .cse9 .cse20) (and .cse0 .cse17 .cse15 .cse2) (and .cse12 (and .cse4 (<= 0 (+ ~a0~0 60)) .cse10)) (and .cse4 .cse15 .cse10) (and .cse0 .cse1 .cse15 .cse10) (< 0 .cse18)))) [2018-11-10 00:50:44,885 INFO L425 ceAbstractionStarter]: For program point L1774-1(line 1774) no Hoare annotation was computed. [2018-11-10 00:50:44,885 INFO L425 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2018-11-10 00:50:44,885 INFO L425 ceAbstractionStarter]: For program point L1766-1(lines 1766 1775) no Hoare annotation was computed. [2018-11-10 00:50:44,886 INFO L421 ceAbstractionStarter]: At program point L1766-3(lines 1766 1775) the Hoare annotation is: (let ((.cse19 (+ ~a29~0 16)) (.cse5 (<= ~a29~0 599999)) (.cse0 (< 0 (+ ~a4~0 86))) (.cse17 (<= (+ ~a0~0 99) 0)) (.cse13 (= ~a2~0 2)) (.cse14 (+ ~a0~0 61))) (let ((.cse7 (<= (+ ~a0~0 98) 0)) (.cse3 (<= .cse14 0)) (.cse11 (exists ((v_prenex_2 Int)) (let ((.cse21 (+ (* 4 (div v_prenex_2 5)) 4))) (let ((.cse22 (mod .cse21 299978))) (and (< .cse21 0) (not (= (mod v_prenex_2 5) 0)) (< v_prenex_2 0) (not (= 0 .cse22)) (<= (+ .cse22 43) ~a29~0)))))) (.cse6 (= 1 ~a2~0)) (.cse8 (<= 0 (+ ~a4~0 74))) (.cse16 (= 3 ~a2~0)) (.cse9 (<= 0 (+ ~a29~0 13))) (.cse20 (and .cse5 (and .cse0 .cse17 .cse13) (<= |old(~a2~0)| 2))) (.cse2 (= 5 ~a2~0)) (.cse12 (exists ((v_~a29~0_907 Int)) (and (<= 0 v_~a29~0_907) (<= ~a29~0 (+ (mod v_~a29~0_907 29) 14))))) (.cse4 (<= (+ ~a4~0 89) 0)) (.cse1 (<= (+ ~a0~0 147) 0)) (.cse15 (<= .cse19 0)) (.cse10 (= 4 ~a2~0)) (.cse18 (+ |old(~a4~0)| 89))) (or (and .cse0 .cse1 .cse2) (and .cse3 (and .cse4 .cse5 .cse6)) (and .cse7 .cse5 .cse8 .cse9 .cse10) (and .cse7 .cse0 .cse2 .cse11) (and .cse5 .cse0 .cse6 .cse1) (and .cse12 .cse7 .cse0 .cse2 .cse9) (and .cse4 .cse5 .cse2 .cse3) (not (= 1 |old(~a2~0)|)) (and .cse12 .cse7 .cse0 .cse13 .cse9) (and (or (< 0 .cse14) .cse15 (< 43 ~a29~0)) .cse4 .cse5 .cse16) (and .cse4 .cse7) (and .cse0 .cse17 .cse13 .cse11) (and .cse5 .cse1 .cse2 .cse11) (and .cse6 (and .cse4 .cse15)) (not (= 0 (+ |old(~a29~0)| 127))) (and (and .cse4 .cse5 (= 2 ~a2~0)) .cse9) (and .cse12 (and .cse4 .cse2)) (and .cse1 (and .cse5 .cse16) .cse9) (and .cse5 .cse0 .cse1 .cse11 .cse10) (and .cse4 .cse13 .cse3) (and .cse0 .cse6 .cse15 .cse3) (and .cse4 .cse5 .cse2 .cse11) (and .cse1 (and .cse0 .cse15 .cse16)) (< .cse18 0) (and (and .cse4 .cse13) .cse15) (and .cse12 .cse0 .cse6 (or (= ~a29~0 |old(~a29~0)|) (< 0 .cse19))) (and .cse1 .cse20) (and .cse17 .cse8 .cse16) (< (+ |old(~a0~0)| 60) 0) (and .cse9 .cse20) (and .cse0 .cse17 .cse15 .cse2) (and .cse12 (and .cse4 (<= 0 (+ ~a0~0 60)) .cse10)) (and .cse4 .cse15 .cse10) (and .cse0 .cse1 .cse15 .cse10) (< 0 .cse18)))) [2018-11-10 00:50:44,886 INFO L425 ceAbstractionStarter]: For program point L1766-4(lines 1760 1776) no Hoare annotation was computed. [2018-11-10 00:50:44,894 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,894 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,894 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,895 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,895 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,895 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:44,895 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:44,895 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:44,896 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:44,896 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,896 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,896 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,896 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,896 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,897 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,897 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,897 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,897 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,898 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,898 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:44,898 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:44,898 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,899 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,899 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,899 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,899 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,900 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,900 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,900 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,900 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,901 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,901 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:44,901 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:44,901 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:44,901 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:44,910 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,911 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,911 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,911 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,911 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,912 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:44,912 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:44,912 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:44,912 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:44,913 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,913 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,913 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,913 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,914 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,914 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,914 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,914 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,915 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,915 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,915 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:44,915 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:44,916 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,916 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,916 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,916 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,917 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,917 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,917 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,917 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,918 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,918 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:44,918 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:44,918 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:44,919 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:44,919 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:44,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:50:44 BoogieIcfgContainer [2018-11-10 00:50:44,922 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 00:50:44,922 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 00:50:44,922 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 00:50:44,922 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 00:50:44,925 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:41:37" (3/4) ... [2018-11-10 00:50:44,928 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 00:50:44,935 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 00:50:44,935 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output2 [2018-11-10 00:50:44,936 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-10 00:50:44,936 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 00:50:44,956 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 00:50:44,957 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 00:50:44,984 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((0 < a4 + 86 && a0 + 147 <= 0) && 5 == a2) || (a0 + 61 <= 0 && (a4 + 89 <= 0 && a29 <= 599999) && 1 == a2)) || ((((a0 + 98 <= 0 && a29 <= 599999) && 0 <= a4 + 74) && 0 <= a29 + 13) && 4 == a2)) || (((a0 + 98 <= 0 && 0 < a4 + 86) && 5 == a2) && (\exists v_prenex_2 : int :: (((4 * (v_prenex_2 / 5) + 4 < 0 && !(v_prenex_2 % 5 == 0)) && v_prenex_2 < 0) && !(0 == (4 * (v_prenex_2 / 5) + 4) % 299978)) && (4 * (v_prenex_2 / 5) + 4) % 299978 + 43 <= a29))) || (((a29 <= 599999 && 0 < a4 + 86) && 1 == a2) && a0 + 147 <= 0)) || (((((\exists v_~a29~0_907 : int :: 0 <= v_~a29~0_907 && a29 <= v_~a29~0_907 % 29 + 14) && a0 + 98 <= 0) && 0 < a4 + 86) && 5 == a2) && 0 <= a29 + 13)) || (((a4 + 89 <= 0 && a29 <= 599999) && 5 == a2) && a0 + 61 <= 0)) || !(1 == \old(a2))) || (((((\exists v_~a29~0_907 : int :: 0 <= v_~a29~0_907 && a29 <= v_~a29~0_907 % 29 + 14) && a0 + 98 <= 0) && 0 < a4 + 86) && a2 == 2) && 0 <= a29 + 13)) || (((((0 < a0 + 61 || a29 + 16 <= 0) || 43 < a29) && a4 + 89 <= 0) && a29 <= 599999) && 3 == a2)) || (a4 + 89 <= 0 && a0 + 98 <= 0)) || (((0 < a4 + 86 && a0 + 99 <= 0) && a2 == 2) && (\exists v_prenex_2 : int :: (((4 * (v_prenex_2 / 5) + 4 < 0 && !(v_prenex_2 % 5 == 0)) && v_prenex_2 < 0) && !(0 == (4 * (v_prenex_2 / 5) + 4) % 299978)) && (4 * (v_prenex_2 / 5) + 4) % 299978 + 43 <= a29))) || (((a29 <= 599999 && a0 + 147 <= 0) && 5 == a2) && (\exists v_prenex_2 : int :: (((4 * (v_prenex_2 / 5) + 4 < 0 && !(v_prenex_2 % 5 == 0)) && v_prenex_2 < 0) && !(0 == (4 * (v_prenex_2 / 5) + 4) % 299978)) && (4 * (v_prenex_2 / 5) + 4) % 299978 + 43 <= a29))) || (1 == a2 && a4 + 89 <= 0 && a29 + 16 <= 0)) || !(0 == \old(a29) + 127)) || (((a4 + 89 <= 0 && a29 <= 599999) && 2 == a2) && 0 <= a29 + 13)) || ((\exists v_~a29~0_907 : int :: 0 <= v_~a29~0_907 && a29 <= v_~a29~0_907 % 29 + 14) && a4 + 89 <= 0 && 5 == a2)) || ((a0 + 147 <= 0 && a29 <= 599999 && 3 == a2) && 0 <= a29 + 13)) || ((((a29 <= 599999 && 0 < a4 + 86) && a0 + 147 <= 0) && (\exists v_prenex_2 : int :: (((4 * (v_prenex_2 / 5) + 4 < 0 && !(v_prenex_2 % 5 == 0)) && v_prenex_2 < 0) && !(0 == (4 * (v_prenex_2 / 5) + 4) % 299978)) && (4 * (v_prenex_2 / 5) + 4) % 299978 + 43 <= a29)) && 4 == a2)) || ((a4 + 89 <= 0 && a2 == 2) && a0 + 61 <= 0)) || (((0 < a4 + 86 && 1 == a2) && a29 + 16 <= 0) && a0 + 61 <= 0)) || (((a4 + 89 <= 0 && a29 <= 599999) && 5 == a2) && (\exists v_prenex_2 : int :: (((4 * (v_prenex_2 / 5) + 4 < 0 && !(v_prenex_2 % 5 == 0)) && v_prenex_2 < 0) && !(0 == (4 * (v_prenex_2 / 5) + 4) % 299978)) && (4 * (v_prenex_2 / 5) + 4) % 299978 + 43 <= a29))) || (a0 + 147 <= 0 && (0 < a4 + 86 && a29 + 16 <= 0) && 3 == a2)) || \old(a4) + 89 < 0) || ((a4 + 89 <= 0 && a2 == 2) && a29 + 16 <= 0)) || ((((\exists v_~a29~0_907 : int :: 0 <= v_~a29~0_907 && a29 <= v_~a29~0_907 % 29 + 14) && 0 < a4 + 86) && 1 == a2) && (a29 == \old(a29) || 0 < a29 + 16))) || (a0 + 147 <= 0 && (a29 <= 599999 && (0 < a4 + 86 && a0 + 99 <= 0) && a2 == 2) && \old(a2) <= 2)) || ((a0 + 99 <= 0 && 0 <= a4 + 74) && 3 == a2)) || \old(a0) + 60 < 0) || (0 <= a29 + 13 && (a29 <= 599999 && (0 < a4 + 86 && a0 + 99 <= 0) && a2 == 2) && \old(a2) <= 2)) || (((0 < a4 + 86 && a0 + 99 <= 0) && a29 + 16 <= 0) && 5 == a2)) || ((\exists v_~a29~0_907 : int :: 0 <= v_~a29~0_907 && a29 <= v_~a29~0_907 % 29 + 14) && (a4 + 89 <= 0 && 0 <= a0 + 60) && 4 == a2)) || ((a4 + 89 <= 0 && a29 + 16 <= 0) && 4 == a2)) || (((0 < a4 + 86 && a0 + 147 <= 0) && a29 + 16 <= 0) && 4 == a2)) || 0 < \old(a4) + 89 [2018-11-10 00:50:45,127 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bd868bb5-4aba-47ad-b842-64d0c41e268d/bin-2019/uautomizer/witness.graphml [2018-11-10 00:50:45,127 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 00:50:45,128 INFO L168 Benchmark]: Toolchain (without parser) took 551501.47 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.4 GB). Free memory was 948.4 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-11-10 00:50:45,129 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:50:45,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 676.29 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 854.4 MB in the end (delta: 94.0 MB). Peak memory consumption was 94.0 MB. Max. memory is 11.5 GB. [2018-11-10 00:50:45,129 INFO L168 Benchmark]: Boogie Preprocessor took 172.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 854.4 MB in the beginning and 1.1 GB in the end (delta: -280.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-11-10 00:50:45,129 INFO L168 Benchmark]: RCFGBuilder took 2634.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 841.0 MB in the end (delta: 293.7 MB). Peak memory consumption was 293.7 MB. Max. memory is 11.5 GB. [2018-11-10 00:50:45,129 INFO L168 Benchmark]: TraceAbstraction took 547810.23 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 841.0 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2018-11-10 00:50:45,130 INFO L168 Benchmark]: Witness Printer took 205.07 ms. Allocated memory is still 5.4 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 75.1 MB). Peak memory consumption was 75.1 MB. Max. memory is 11.5 GB. [2018-11-10 00:50:45,131 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.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 676.29 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 854.4 MB in the end (delta: 94.0 MB). Peak memory consumption was 94.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 172.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 854.4 MB in the beginning and 1.1 GB in the end (delta: -280.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2634.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 841.0 MB in the end (delta: 293.7 MB). Peak memory consumption was 293.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 547810.23 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 841.0 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 205.07 ms. Allocated memory is still 5.4 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 75.1 MB). Peak memory consumption was 75.1 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_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 163]: 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: 1766]: Loop Invariant [2018-11-10 00:50:45,134 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,135 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,135 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,135 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,136 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,136 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:45,136 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:45,136 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:45,137 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:45,137 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,137 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,137 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,138 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,138 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,138 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,138 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,138 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,139 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,139 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,139 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:45,139 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:45,139 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,140 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,140 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,140 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,140 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,140 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,141 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,141 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,141 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,141 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,141 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:45,142 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:45,142 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:45,142 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:45,143 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,143 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,143 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,144 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,144 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,144 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:45,144 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:45,145 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:45,145 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:45,145 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,145 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,146 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,146 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,146 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,146 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,147 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,147 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,147 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,147 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,147 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:45,148 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:45,148 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,148 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,148 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,148 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,149 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,149 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,149 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,149 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,149 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,150 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-10 00:50:45,150 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:45,150 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:45,150 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] [2018-11-10 00:50:45,150 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_907,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((0 < a4 + 86 && a0 + 147 <= 0) && 5 == a2) || (a0 + 61 <= 0 && (a4 + 89 <= 0 && a29 <= 599999) && 1 == a2)) || ((((a0 + 98 <= 0 && a29 <= 599999) && 0 <= a4 + 74) && 0 <= a29 + 13) && 4 == a2)) || (((a0 + 98 <= 0 && 0 < a4 + 86) && 5 == a2) && (\exists v_prenex_2 : int :: (((4 * (v_prenex_2 / 5) + 4 < 0 && !(v_prenex_2 % 5 == 0)) && v_prenex_2 < 0) && !(0 == (4 * (v_prenex_2 / 5) + 4) % 299978)) && (4 * (v_prenex_2 / 5) + 4) % 299978 + 43 <= a29))) || (((a29 <= 599999 && 0 < a4 + 86) && 1 == a2) && a0 + 147 <= 0)) || (((((\exists v_~a29~0_907 : int :: 0 <= v_~a29~0_907 && a29 <= v_~a29~0_907 % 29 + 14) && a0 + 98 <= 0) && 0 < a4 + 86) && 5 == a2) && 0 <= a29 + 13)) || (((a4 + 89 <= 0 && a29 <= 599999) && 5 == a2) && a0 + 61 <= 0)) || !(1 == \old(a2))) || (((((\exists v_~a29~0_907 : int :: 0 <= v_~a29~0_907 && a29 <= v_~a29~0_907 % 29 + 14) && a0 + 98 <= 0) && 0 < a4 + 86) && a2 == 2) && 0 <= a29 + 13)) || (((((0 < a0 + 61 || a29 + 16 <= 0) || 43 < a29) && a4 + 89 <= 0) && a29 <= 599999) && 3 == a2)) || (a4 + 89 <= 0 && a0 + 98 <= 0)) || (((0 < a4 + 86 && a0 + 99 <= 0) && a2 == 2) && (\exists v_prenex_2 : int :: (((4 * (v_prenex_2 / 5) + 4 < 0 && !(v_prenex_2 % 5 == 0)) && v_prenex_2 < 0) && !(0 == (4 * (v_prenex_2 / 5) + 4) % 299978)) && (4 * (v_prenex_2 / 5) + 4) % 299978 + 43 <= a29))) || (((a29 <= 599999 && a0 + 147 <= 0) && 5 == a2) && (\exists v_prenex_2 : int :: (((4 * (v_prenex_2 / 5) + 4 < 0 && !(v_prenex_2 % 5 == 0)) && v_prenex_2 < 0) && !(0 == (4 * (v_prenex_2 / 5) + 4) % 299978)) && (4 * (v_prenex_2 / 5) + 4) % 299978 + 43 <= a29))) || (1 == a2 && a4 + 89 <= 0 && a29 + 16 <= 0)) || !(0 == \old(a29) + 127)) || (((a4 + 89 <= 0 && a29 <= 599999) && 2 == a2) && 0 <= a29 + 13)) || ((\exists v_~a29~0_907 : int :: 0 <= v_~a29~0_907 && a29 <= v_~a29~0_907 % 29 + 14) && a4 + 89 <= 0 && 5 == a2)) || ((a0 + 147 <= 0 && a29 <= 599999 && 3 == a2) && 0 <= a29 + 13)) || ((((a29 <= 599999 && 0 < a4 + 86) && a0 + 147 <= 0) && (\exists v_prenex_2 : int :: (((4 * (v_prenex_2 / 5) + 4 < 0 && !(v_prenex_2 % 5 == 0)) && v_prenex_2 < 0) && !(0 == (4 * (v_prenex_2 / 5) + 4) % 299978)) && (4 * (v_prenex_2 / 5) + 4) % 299978 + 43 <= a29)) && 4 == a2)) || ((a4 + 89 <= 0 && a2 == 2) && a0 + 61 <= 0)) || (((0 < a4 + 86 && 1 == a2) && a29 + 16 <= 0) && a0 + 61 <= 0)) || (((a4 + 89 <= 0 && a29 <= 599999) && 5 == a2) && (\exists v_prenex_2 : int :: (((4 * (v_prenex_2 / 5) + 4 < 0 && !(v_prenex_2 % 5 == 0)) && v_prenex_2 < 0) && !(0 == (4 * (v_prenex_2 / 5) + 4) % 299978)) && (4 * (v_prenex_2 / 5) + 4) % 299978 + 43 <= a29))) || (a0 + 147 <= 0 && (0 < a4 + 86 && a29 + 16 <= 0) && 3 == a2)) || \old(a4) + 89 < 0) || ((a4 + 89 <= 0 && a2 == 2) && a29 + 16 <= 0)) || ((((\exists v_~a29~0_907 : int :: 0 <= v_~a29~0_907 && a29 <= v_~a29~0_907 % 29 + 14) && 0 < a4 + 86) && 1 == a2) && (a29 == \old(a29) || 0 < a29 + 16))) || (a0 + 147 <= 0 && (a29 <= 599999 && (0 < a4 + 86 && a0 + 99 <= 0) && a2 == 2) && \old(a2) <= 2)) || ((a0 + 99 <= 0 && 0 <= a4 + 74) && 3 == a2)) || \old(a0) + 60 < 0) || (0 <= a29 + 13 && (a29 <= 599999 && (0 < a4 + 86 && a0 + 99 <= 0) && a2 == 2) && \old(a2) <= 2)) || (((0 < a4 + 86 && a0 + 99 <= 0) && a29 + 16 <= 0) && 5 == a2)) || ((\exists v_~a29~0_907 : int :: 0 <= v_~a29~0_907 && a29 <= v_~a29~0_907 % 29 + 14) && (a4 + 89 <= 0 && 0 <= a0 + 60) && 4 == a2)) || ((a4 + 89 <= 0 && a29 + 16 <= 0) && 4 == a2)) || (((0 < a4 + 86 && a0 + 147 <= 0) && a29 + 16 <= 0) && 4 == a2)) || 0 < \old(a4) + 89 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 438 locations, 1 error locations. SAFE Result, 547.7s OverallTime, 15 OverallIterations, 8 TraceHistogramMax, 328.3s AutomataDifference, 0.0s DeadEndRemovalTime, 199.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 4327 SDtfs, 47281 SDslu, 5719 SDs, 0 SdLazy, 68467 SolverSat, 12084 SolverUnsat, 438 SolverUnknown, 0 SolverNotchecked, 306.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7080 GetRequests, 6798 SyntacticMatches, 10 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3671 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82524occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 6.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 31011 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 4942 PreInvPairs, 7318 NumberOfFragments, 7701 HoareAnnotationTreeSize, 4942 FomulaSimplifications, 350992 FormulaSimplificationTreeSizeReduction, 5.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 410760 FormulaSimplificationTreeSizeReductionInter, 194.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 14470 NumberOfCodeBlocks, 14470 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 14446 ConstructedInterpolants, 80 QuantifiedInterpolants, 24644520 SizeOfPredicates, 10 NumberOfNonLiveVariables, 9047 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 24 InterpolantComputations, 11 PerfectInterpolantSequences, 21287/22548 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...