./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label49_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cab72161-a79a-46ee-9880-0dd0b48d58c6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cab72161-a79a-46ee-9880-0dd0b48d58c6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cab72161-a79a-46ee-9880-0dd0b48d58c6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cab72161-a79a-46ee-9880-0dd0b48d58c6/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label49_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cab72161-a79a-46ee-9880-0dd0b48d58c6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cab72161-a79a-46ee-9880-0dd0b48d58c6/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 c2ee6781c62be40fa372129eaacaba9832af3ce9 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 11:50:54,303 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:50:54,305 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:50:54,311 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:50:54,311 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:50:54,312 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:50:54,313 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:50:54,314 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:50:54,315 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:50:54,315 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:50:54,316 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:50:54,316 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:50:54,317 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:50:54,317 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:50:54,318 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:50:54,319 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:50:54,319 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:50:54,320 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:50:54,321 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:50:54,322 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:50:54,322 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:50:54,323 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:50:54,325 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:50:54,325 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:50:54,325 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:50:54,326 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:50:54,326 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:50:54,327 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:50:54,327 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:50:54,328 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:50:54,328 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:50:54,329 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:50:54,329 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:50:54,329 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:50:54,330 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:50:54,330 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:50:54,330 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cab72161-a79a-46ee-9880-0dd0b48d58c6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 11:50:54,337 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:50:54,337 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:50:54,338 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:50:54,338 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 11:50:54,339 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:50:54,339 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:50:54,339 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:50:54,339 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:50:54,339 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:50:54,339 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:50:54,339 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:50:54,340 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:50:54,340 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 11:50:54,340 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:50:54,340 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 11:50:54,340 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:50:54,340 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:50:54,340 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 11:50:54,341 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:50:54,341 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:50:54,341 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:50:54,341 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 11:50:54,341 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:50:54,341 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:50:54,341 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:50:54,341 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 11:50:54,342 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:50:54,342 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:50:54,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 11:50:54,342 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_cab72161-a79a-46ee-9880-0dd0b48d58c6/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 -> c2ee6781c62be40fa372129eaacaba9832af3ce9 [2018-11-10 11:50:54,366 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:50:54,375 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:50:54,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:50:54,379 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:50:54,379 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:50:54,380 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cab72161-a79a-46ee-9880-0dd0b48d58c6/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem10_label49_true-unreach-call.c [2018-11-10 11:50:54,427 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cab72161-a79a-46ee-9880-0dd0b48d58c6/bin-2019/uautomizer/data/1fea59cf3/93ca1a4c9cc8410d838a51f669d03e40/FLAG5de8c7fa1 [2018-11-10 11:50:54,791 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:50:54,791 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cab72161-a79a-46ee-9880-0dd0b48d58c6/sv-benchmarks/c/eca-rers2012/Problem10_label49_true-unreach-call.c [2018-11-10 11:50:54,802 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cab72161-a79a-46ee-9880-0dd0b48d58c6/bin-2019/uautomizer/data/1fea59cf3/93ca1a4c9cc8410d838a51f669d03e40/FLAG5de8c7fa1 [2018-11-10 11:50:54,814 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cab72161-a79a-46ee-9880-0dd0b48d58c6/bin-2019/uautomizer/data/1fea59cf3/93ca1a4c9cc8410d838a51f669d03e40 [2018-11-10 11:50:54,816 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:50:54,817 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 11:50:54,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:50:54,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:50:54,820 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:50:54,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:50:54" (1/1) ... [2018-11-10 11:50:54,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61258a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:54, skipping insertion in model container [2018-11-10 11:50:54,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:50:54" (1/1) ... [2018-11-10 11:50:54,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:50:54,860 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:50:55,081 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:50:55,083 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:50:55,151 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:50:55,167 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:50:55,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:55 WrapperNode [2018-11-10 11:50:55,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:50:55,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:50:55,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:50:55,169 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:50:55,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:55" (1/1) ... [2018-11-10 11:50:55,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:55" (1/1) ... [2018-11-10 11:50:55,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:55" (1/1) ... [2018-11-10 11:50:55,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:55" (1/1) ... [2018-11-10 11:50:55,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:55" (1/1) ... [2018-11-10 11:50:55,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:55" (1/1) ... [2018-11-10 11:50:55,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:55" (1/1) ... [2018-11-10 11:50:55,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:50:55,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:50:55,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:50:55,296 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:50:55,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cab72161-a79a-46ee-9880-0dd0b48d58c6/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 11:50:55,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 11:50:55,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:50:55,349 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-10 11:50:55,349 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 11:50:55,349 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-10 11:50:55,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 11:50:55,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 11:50:55,350 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 11:50:55,350 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 11:50:55,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 11:50:55,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:50:56,246 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:50:56,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:50:56 BoogieIcfgContainer [2018-11-10 11:50:56,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:50:56,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 11:50:56,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 11:50:56,250 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 11:50:56,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:50:54" (1/3) ... [2018-11-10 11:50:56,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32236ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:50:56, skipping insertion in model container [2018-11-10 11:50:56,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:55" (2/3) ... [2018-11-10 11:50:56,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32236ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:50:56, skipping insertion in model container [2018-11-10 11:50:56,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:50:56" (3/3) ... [2018-11-10 11:50:56,252 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label49_true-unreach-call.c [2018-11-10 11:50:56,259 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 11:50:56,264 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 11:50:56,273 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 11:50:56,297 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:50:56,298 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 11:50:56,298 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 11:50:56,298 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 11:50:56,298 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:50:56,298 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:50:56,298 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 11:50:56,298 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:50:56,299 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 11:50:56,316 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-10 11:50:56,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 11:50:56,322 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:50:56,322 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:50:56,324 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:50:56,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:56,328 INFO L82 PathProgramCache]: Analyzing trace with hash -654369111, now seen corresponding path program 1 times [2018-11-10 11:50:56,329 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:56,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:56,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:56,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:56,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:56,509 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 11:50:56,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:50:56,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:50:56,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:50:56,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:50:56,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:50:56,529 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-10 11:50:57,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:50:57,180 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-10 11:50:57,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:50:57,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 11:50:57,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:50:57,191 INFO L225 Difference]: With dead ends: 574 [2018-11-10 11:50:57,191 INFO L226 Difference]: Without dead ends: 356 [2018-11-10 11:50:57,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:50:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-10 11:50:57,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-10 11:50:57,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-10 11:50:57,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-11-10 11:50:57,243 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 29 [2018-11-10 11:50:57,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:50:57,244 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-11-10 11:50:57,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:50:57,244 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-11-10 11:50:57,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 11:50:57,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:50:57,247 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:50:57,248 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:50:57,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:57,249 INFO L82 PathProgramCache]: Analyzing trace with hash 350526568, now seen corresponding path program 1 times [2018-11-10 11:50:57,249 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:57,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:57,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:57,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:57,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:57,408 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:50:57,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:50:57,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:50:57,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:50:57,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:50:57,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:50:57,411 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 6 states. [2018-11-10 11:50:57,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:50:57,978 INFO L93 Difference]: Finished difference Result 867 states and 1507 transitions. [2018-11-10 11:50:57,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:50:57,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-11-10 11:50:57,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:50:57,982 INFO L225 Difference]: With dead ends: 867 [2018-11-10 11:50:57,982 INFO L226 Difference]: Without dead ends: 517 [2018-11-10 11:50:57,984 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 11:50:57,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-11-10 11:50:58,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 508. [2018-11-10 11:50:58,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-11-10 11:50:58,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 831 transitions. [2018-11-10 11:50:58,004 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 831 transitions. Word has length 103 [2018-11-10 11:50:58,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:50:58,005 INFO L481 AbstractCegarLoop]: Abstraction has 508 states and 831 transitions. [2018-11-10 11:50:58,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:50:58,005 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 831 transitions. [2018-11-10 11:50:58,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 11:50:58,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:50:58,007 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:50:58,007 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:50:58,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:58,007 INFO L82 PathProgramCache]: Analyzing trace with hash -781565036, now seen corresponding path program 1 times [2018-11-10 11:50:58,007 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:58,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:58,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:58,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:58,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:50:58,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:50:58,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:50:58,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:50:58,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:50:58,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:50:58,085 INFO L87 Difference]: Start difference. First operand 508 states and 831 transitions. Second operand 4 states. [2018-11-10 11:50:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:50:58,862 INFO L93 Difference]: Finished difference Result 1742 states and 2991 transitions. [2018-11-10 11:50:58,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:50:58,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-11-10 11:50:58,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:50:58,868 INFO L225 Difference]: With dead ends: 1742 [2018-11-10 11:50:58,869 INFO L226 Difference]: Without dead ends: 1240 [2018-11-10 11:50:58,871 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 11:50:58,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2018-11-10 11:50:58,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1240. [2018-11-10 11:50:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1240 states. [2018-11-10 11:50:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1869 transitions. [2018-11-10 11:50:58,901 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1869 transitions. Word has length 109 [2018-11-10 11:50:58,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:50:58,901 INFO L481 AbstractCegarLoop]: Abstraction has 1240 states and 1869 transitions. [2018-11-10 11:50:58,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:50:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1869 transitions. [2018-11-10 11:50:58,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-10 11:50:58,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:50:58,907 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:50:58,907 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:50:58,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:58,908 INFO L82 PathProgramCache]: Analyzing trace with hash -883752961, now seen corresponding path program 1 times [2018-11-10 11:50:58,908 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:58,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:58,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:58,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:58,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:59,048 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:50:59,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:50:59,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:50:59,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:50:59,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:50:59,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:50:59,050 INFO L87 Difference]: Start difference. First operand 1240 states and 1869 transitions. Second operand 6 states. [2018-11-10 11:50:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:50:59,754 INFO L93 Difference]: Finished difference Result 2759 states and 4120 transitions. [2018-11-10 11:50:59,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:50:59,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2018-11-10 11:50:59,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:50:59,765 INFO L225 Difference]: With dead ends: 2759 [2018-11-10 11:50:59,765 INFO L226 Difference]: Without dead ends: 1525 [2018-11-10 11:50:59,768 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 11:50:59,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2018-11-10 11:50:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1485. [2018-11-10 11:50:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2018-11-10 11:50:59,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 2034 transitions. [2018-11-10 11:50:59,799 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 2034 transitions. Word has length 166 [2018-11-10 11:50:59,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:50:59,800 INFO L481 AbstractCegarLoop]: Abstraction has 1485 states and 2034 transitions. [2018-11-10 11:50:59,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:50:59,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 2034 transitions. [2018-11-10 11:50:59,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 11:50:59,802 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:50:59,803 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:50:59,803 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:50:59,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:59,803 INFO L82 PathProgramCache]: Analyzing trace with hash 752941163, now seen corresponding path program 1 times [2018-11-10 11:50:59,803 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:59,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:59,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:59,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:59,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:59,927 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:50:59,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:50:59,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:50:59,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:50:59,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:50:59,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:50:59,928 INFO L87 Difference]: Start difference. First operand 1485 states and 2034 transitions. Second operand 6 states. [2018-11-10 11:51:00,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:00,726 INFO L93 Difference]: Finished difference Result 3547 states and 5008 transitions. [2018-11-10 11:51:00,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:51:00,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2018-11-10 11:51:00,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:00,733 INFO L225 Difference]: With dead ends: 3547 [2018-11-10 11:51:00,733 INFO L226 Difference]: Without dead ends: 2068 [2018-11-10 11:51:00,736 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 11:51:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2018-11-10 11:51:00,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2051. [2018-11-10 11:51:00,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2051 states. [2018-11-10 11:51:00,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 2708 transitions. [2018-11-10 11:51:00,774 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 2708 transitions. Word has length 172 [2018-11-10 11:51:00,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:00,775 INFO L481 AbstractCegarLoop]: Abstraction has 2051 states and 2708 transitions. [2018-11-10 11:51:00,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:51:00,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 2708 transitions. [2018-11-10 11:51:00,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-10 11:51:00,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:00,779 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:51:00,780 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:51:00,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:00,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1320084340, now seen corresponding path program 1 times [2018-11-10 11:51:00,780 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:51:00,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:51:00,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:00,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:00,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:00,949 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-10 11:51:00,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:51:00,949 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cab72161-a79a-46ee-9880-0dd0b48d58c6/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 11:51:00,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:01,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:51:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 122 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:51:01,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:51:01,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-10 11:51:01,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 11:51:01,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 11:51:01,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-10 11:51:01,135 INFO L87 Difference]: Start difference. First operand 2051 states and 2708 transitions. Second operand 11 states. [2018-11-10 11:51:03,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:03,040 INFO L93 Difference]: Finished difference Result 5282 states and 7182 transitions. [2018-11-10 11:51:03,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 11:51:03,040 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 246 [2018-11-10 11:51:03,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:03,045 INFO L225 Difference]: With dead ends: 5282 [2018-11-10 11:51:03,045 INFO L226 Difference]: Without dead ends: 1645 [2018-11-10 11:51:03,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 253 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2018-11-10 11:51:03,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2018-11-10 11:51:03,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1200. [2018-11-10 11:51:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. [2018-11-10 11:51:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1360 transitions. [2018-11-10 11:51:03,075 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1360 transitions. Word has length 246 [2018-11-10 11:51:03,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:03,076 INFO L481 AbstractCegarLoop]: Abstraction has 1200 states and 1360 transitions. [2018-11-10 11:51:03,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 11:51:03,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1360 transitions. [2018-11-10 11:51:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-10 11:51:03,079 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:03,079 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:51:03,079 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:51:03,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:03,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1377879184, now seen corresponding path program 1 times [2018-11-10 11:51:03,080 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:51:03,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:51:03,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:03,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:03,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 118 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:51:03,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:51:03,639 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cab72161-a79a-46ee-9880-0dd0b48d58c6/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 11:51:03,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:03,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:51:03,988 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-10 11:51:04,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:51:04,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 16 [2018-11-10 11:51:04,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 11:51:04,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 11:51:04,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-11-10 11:51:04,007 INFO L87 Difference]: Start difference. First operand 1200 states and 1360 transitions. Second operand 16 states. [2018-11-10 11:51:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:07,655 INFO L93 Difference]: Finished difference Result 4224 states and 5030 transitions. [2018-11-10 11:51:07,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-10 11:51:07,655 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 260 [2018-11-10 11:51:07,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:07,664 INFO L225 Difference]: With dead ends: 4224 [2018-11-10 11:51:07,665 INFO L226 Difference]: Without dead ends: 2640 [2018-11-10 11:51:07,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=674, Invalid=1876, Unknown=0, NotChecked=0, Total=2550 [2018-11-10 11:51:07,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2018-11-10 11:51:07,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2229. [2018-11-10 11:51:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2229 states. [2018-11-10 11:51:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 2503 transitions. [2018-11-10 11:51:07,734 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 2503 transitions. Word has length 260 [2018-11-10 11:51:07,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:07,734 INFO L481 AbstractCegarLoop]: Abstraction has 2229 states and 2503 transitions. [2018-11-10 11:51:07,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 11:51:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 2503 transitions. [2018-11-10 11:51:07,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-11-10 11:51:07,741 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:07,741 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:51:07,741 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:51:07,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:07,742 INFO L82 PathProgramCache]: Analyzing trace with hash -827909397, now seen corresponding path program 1 times [2018-11-10 11:51:07,742 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:51:07,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:51:07,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:07,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:07,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 144 proven. 140 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:51:08,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:51:08,057 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cab72161-a79a-46ee-9880-0dd0b48d58c6/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 11:51:08,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:08,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:51:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 214 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 11:51:08,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:51:08,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2018-11-10 11:51:08,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 11:51:08,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 11:51:08,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-11-10 11:51:08,254 INFO L87 Difference]: Start difference. First operand 2229 states and 2503 transitions. Second operand 16 states. [2018-11-10 11:51:13,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:13,356 INFO L93 Difference]: Finished difference Result 5396 states and 6724 transitions. [2018-11-10 11:51:13,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-10 11:51:13,357 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 292 [2018-11-10 11:51:13,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:13,366 INFO L225 Difference]: With dead ends: 5396 [2018-11-10 11:51:13,366 INFO L226 Difference]: Without dead ends: 3317 [2018-11-10 11:51:13,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 323 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1371 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=742, Invalid=3680, Unknown=0, NotChecked=0, Total=4422 [2018-11-10 11:51:13,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2018-11-10 11:51:13,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 2859. [2018-11-10 11:51:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2859 states. [2018-11-10 11:51:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 3182 transitions. [2018-11-10 11:51:13,437 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 3182 transitions. Word has length 292 [2018-11-10 11:51:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:13,438 INFO L481 AbstractCegarLoop]: Abstraction has 2859 states and 3182 transitions. [2018-11-10 11:51:13,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 11:51:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 3182 transitions. [2018-11-10 11:51:13,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-11-10 11:51:13,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:13,443 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:51:13,443 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:51:13,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:13,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1909871111, now seen corresponding path program 1 times [2018-11-10 11:51:13,444 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:51:13,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:51:13,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:13,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:13,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 44 proven. 124 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 11:51:13,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:51:13,568 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cab72161-a79a-46ee-9880-0dd0b48d58c6/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 11:51:13,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:13,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:51:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 11:51:13,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:51:13,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-11-10 11:51:13,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:51:13,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:51:13,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:51:13,704 INFO L87 Difference]: Start difference. First operand 2859 states and 3182 transitions. Second operand 6 states. [2018-11-10 11:51:14,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:14,456 INFO L93 Difference]: Finished difference Result 5500 states and 6092 transitions. [2018-11-10 11:51:14,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:51:14,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 295 [2018-11-10 11:51:14,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:14,462 INFO L225 Difference]: With dead ends: 5500 [2018-11-10 11:51:14,462 INFO L226 Difference]: Without dead ends: 2935 [2018-11-10 11:51:14,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:51:14,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2018-11-10 11:51:14,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 2792. [2018-11-10 11:51:14,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2792 states. [2018-11-10 11:51:14,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 3079 transitions. [2018-11-10 11:51:14,507 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 3079 transitions. Word has length 295 [2018-11-10 11:51:14,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:14,508 INFO L481 AbstractCegarLoop]: Abstraction has 2792 states and 3079 transitions. [2018-11-10 11:51:14,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:51:14,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 3079 transitions. [2018-11-10 11:51:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-10 11:51:14,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:14,513 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:51:14,513 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:51:14,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:14,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1643407787, now seen corresponding path program 1 times [2018-11-10 11:51:14,513 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:51:14,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:51:14,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:14,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:14,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:14,649 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 44 proven. 126 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 11:51:14,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:51:14,649 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cab72161-a79a-46ee-9880-0dd0b48d58c6/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 11:51:14,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:14,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:51:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 11:51:14,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:51:14,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-11-10 11:51:14,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:51:14,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:51:14,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:51:14,784 INFO L87 Difference]: Start difference. First operand 2792 states and 3079 transitions. Second operand 9 states. [2018-11-10 11:51:15,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:15,456 INFO L93 Difference]: Finished difference Result 4986 states and 5467 transitions. [2018-11-10 11:51:15,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 11:51:15,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 297 [2018-11-10 11:51:15,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:15,461 INFO L225 Difference]: With dead ends: 4986 [2018-11-10 11:51:15,461 INFO L226 Difference]: Without dead ends: 2796 [2018-11-10 11:51:15,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 306 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2018-11-10 11:51:15,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2018-11-10 11:51:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2644. [2018-11-10 11:51:15,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2644 states. [2018-11-10 11:51:15,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 2856 transitions. [2018-11-10 11:51:15,499 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 2856 transitions. Word has length 297 [2018-11-10 11:51:15,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:15,500 INFO L481 AbstractCegarLoop]: Abstraction has 2644 states and 2856 transitions. [2018-11-10 11:51:15,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:51:15,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 2856 transitions. [2018-11-10 11:51:15,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-11-10 11:51:15,504 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:15,505 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 11:51:15,505 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:51:15,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:15,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1133583438, now seen corresponding path program 1 times [2018-11-10 11:51:15,505 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:51:15,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:51:15,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:15,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:15,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 219 proven. 77 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 11:51:15,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:51:15,786 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cab72161-a79a-46ee-9880-0dd0b48d58c6/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 11:51:15,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:15,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:51:21,166 WARN L179 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 118 DAG size of output: 16 [2018-11-10 11:51:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-11-10 11:51:21,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:51:21,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2018-11-10 11:51:21,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 11:51:21,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 11:51:21,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=119, Unknown=1, NotChecked=0, Total=156 [2018-11-10 11:51:21,272 INFO L87 Difference]: Start difference. First operand 2644 states and 2856 transitions. Second operand 13 states. [2018-11-10 11:51:30,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:30,983 INFO L93 Difference]: Finished difference Result 6325 states and 6949 transitions. [2018-11-10 11:51:30,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-10 11:51:30,983 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 305 [2018-11-10 11:51:30,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:30,984 INFO L225 Difference]: With dead ends: 6325 [2018-11-10 11:51:30,984 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 11:51:30,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 335 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=441, Invalid=1910, Unknown=1, NotChecked=0, Total=2352 [2018-11-10 11:51:30,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 11:51:30,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 11:51:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 11:51:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 11:51:30,992 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 305 [2018-11-10 11:51:30,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:30,992 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:51:30,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 11:51:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:51:30,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 11:51:30,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 11:51:31,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,230 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 184 [2018-11-10 11:51:31,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:51:31,370 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 184 [2018-11-10 11:51:32,373 WARN L179 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 77 [2018-11-10 11:51:33,000 WARN L179 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 85 [2018-11-10 11:51:33,601 WARN L179 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 85 [2018-11-10 11:51:33,602 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 11:51:33,603 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a19~0 |old(~a19~0)|) (= |old(~a10~0)| ~a10~0) (= ~a1~0 |old(~a1~0)|)) [2018-11-10 11:51:33,603 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 11:51:33,603 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-11-10 11:51:33,603 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,603 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,603 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,603 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,603 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,603 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,603 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-11-10 11:51:33,603 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-11-10 11:51:33,603 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-10 11:51:33,603 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-10 11:51:33,603 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-10 11:51:33,603 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-10 11:51:33,603 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-10 11:51:33,604 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-10 11:51:33,604 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-11-10 11:51:33,604 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-11-10 11:51:33,604 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-11-10 11:51:33,604 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,604 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,604 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,604 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,604 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,604 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-11-10 11:51:33,604 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-11-10 11:51:33,604 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-11-10 11:51:33,604 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-11-10 11:51:33,604 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-10 11:51:33,604 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-10 11:51:33,604 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-10 11:51:33,604 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-10 11:51:33,605 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-10 11:51:33,605 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-11-10 11:51:33,605 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-11-10 11:51:33,605 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-11-10 11:51:33,605 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-11-10 11:51:33,605 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-11-10 11:51:33,605 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,605 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,605 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,605 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,605 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,605 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-11-10 11:51:33,605 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-10 11:51:33,605 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-10 11:51:33,606 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-10 11:51:33,606 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-10 11:51:33,606 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-10 11:51:33,606 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-11-10 11:51:33,606 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-11-10 11:51:33,606 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-11-10 11:51:33,606 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-11-10 11:51:33,606 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,606 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,606 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,606 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,606 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,606 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-11-10 11:51:33,606 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-11-10 11:51:33,607 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-11-10 11:51:33,607 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-10 11:51:33,607 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-10 11:51:33,607 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-10 11:51:33,607 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-10 11:51:33,607 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-10 11:51:33,607 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-11-10 11:51:33,607 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-11-10 11:51:33,607 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-11-10 11:51:33,607 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-11-10 11:51:33,607 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-11-10 11:51:33,607 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,607 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,607 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,608 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,608 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,608 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-10 11:51:33,608 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-10 11:51:33,608 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-10 11:51:33,608 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-10 11:51:33,608 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-10 11:51:33,608 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-11-10 11:51:33,608 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-11-10 11:51:33,608 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-11-10 11:51:33,608 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-11-10 11:51:33,608 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,608 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,608 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,608 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,609 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,609 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,609 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,609 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-11-10 11:51:33,609 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-11-10 11:51:33,609 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-11-10 11:51:33,609 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-11-10 11:51:33,609 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-10 11:51:33,609 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-10 11:51:33,609 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-10 11:51:33,609 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-10 11:51:33,609 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-10 11:51:33,609 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-11-10 11:51:33,609 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-11-10 11:51:33,609 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-11-10 11:51:33,610 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-11-10 11:51:33,610 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,610 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,610 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,610 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,610 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,610 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-10 11:51:33,610 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,610 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-11-10 11:51:33,610 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-11-10 11:51:33,610 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-11-10 11:51:33,610 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-10 11:51:33,610 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-10 11:51:33,610 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-10 11:51:33,611 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-10 11:51:33,611 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-10 11:51:33,611 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-10 11:51:33,611 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-11-10 11:51:33,611 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-11-10 11:51:33,611 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-11-10 11:51:33,611 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-11-10 11:51:33,611 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,611 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,611 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,611 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,611 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,611 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,611 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-11-10 11:51:33,612 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-11-10 11:51:33,612 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-11-10 11:51:33,612 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-10 11:51:33,612 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-10 11:51:33,612 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-10 11:51:33,612 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-10 11:51:33,612 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-10 11:51:33,612 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-10 11:51:33,612 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-11-10 11:51:33,612 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-11-10 11:51:33,613 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse11 (= ~a19~0 |old(~a19~0)|)) (.cse12 (= |old(~a10~0)| ~a10~0))) (let ((.cse2 (= 2 |old(~a10~0)|)) (.cse5 (and (= |old(~a19~0)| ~a19~0) .cse12)) (.cse4 (< 8 |old(~a19~0)|)) (.cse9 (<= |old(~a1~0)| 218)) (.cse7 (= 4 |old(~a10~0)|)) (.cse8 (= 10 |old(~a19~0)|)) (.cse10 (= 1 |old(~a10~0)|)) (.cse3 (and (= ~a1~0 |old(~a1~0)|) .cse11 .cse12)) (.cse0 (not (= 14 ~a4~0))) (.cse1 (not (= 0 ~a12~0))) (.cse6 (= 8 |old(~a19~0)|))) (and (or .cse0 .cse1 (not (= 9 |old(~a19~0)|)) .cse2 .cse3) (or .cse4 .cse5 .cse6) (or .cse4 .cse2 .cse5) (or .cse3 (or (or .cse7 .cse8 .cse6) .cse0 .cse1 .cse9)) (or (<= 592098 ~a1~0) .cse7 (< |old(~a1~0)| 592098) .cse8 .cse0 .cse1 .cse10) (or .cse7 .cse4 .cse0 .cse1 .cse10 .cse9 (and (< 218 ~a1~0) .cse11 .cse12)) (or (= 3 |old(~a10~0)|) .cse7 .cse3 .cse8 (forall ((v_prenex_4 Int)) (let ((.cse14 (* 9 v_prenex_4))) (let ((.cse13 (div .cse14 10))) (or (< .cse13 0) (< (+ (mod .cse13 25) 12) |old(~a1~0)|) (< .cse14 0))))) .cse0 .cse1 (= 0 |old(~a10~0)|) .cse10) (or (not .cse10) .cse3 .cse0 .cse1 .cse6) (or .cse3 .cse0 .cse1 .cse6 (< 0 |old(~a10~0)|))))) [2018-11-10 11:51:33,613 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-11-10 11:51:33,613 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-11-10 11:51:33,613 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-11-10 11:51:33,613 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,613 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,613 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,613 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,613 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,613 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,613 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-11-10 11:51:33,613 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-10 11:51:33,613 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-10 11:51:33,613 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-10 11:51:33,614 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-10 11:51:33,614 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-10 11:51:33,614 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-10 11:51:33,614 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-11-10 11:51:33,614 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-11-10 11:51:33,614 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-11-10 11:51:33,614 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-11-10 11:51:33,614 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-11-10 11:51:33,614 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-11-10 11:51:33,614 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,614 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,614 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,614 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,614 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,614 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,614 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 70) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 574) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-10 11:51:33,615 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-10 11:51:33,616 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-10 11:51:33,616 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-10 11:51:33,616 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-10 11:51:33,616 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-10 11:51:33,616 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-11-10 11:51:33,616 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-11-10 11:51:33,616 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-11-10 11:51:33,616 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 11:51:33,616 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 23 ~a1~0) (<= ~a1~0 23) (not (= ~a19~0 10)) (not (= ~a19~0 8)) (= ~a12~0 0) (<= ~a10~0 0) (= ~a4~0 14)) [2018-11-10 11:51:33,616 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 11:51:33,616 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 11:51:33,616 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (< |old(~a1~0)| 23) (= 10 |old(~a19~0)|) (not (= 14 ~a4~0)) (not (= 0 ~a12~0)) (= 8 |old(~a19~0)|) (< 23 |old(~a1~0)|) (< 0 |old(~a10~0)|) (and (= ~a1~0 |old(~a1~0)|) (= ~a19~0 |old(~a19~0)|) (= |old(~a10~0)| ~a10~0))) [2018-11-10 11:51:33,616 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-11-10 11:51:33,616 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse6 (= |old(~a19~0)| ~a19~0)) (.cse1 (or (= 0 |old(~a10~0)|) (<= (+ |old(~a1~0)| 13) 0))) (.cse9 (< 218 ~a1~0)) (.cse2 (not (= ~a19~0 10))) (.cse3 (not (= ~a10~0 4))) (.cse8 (not (= 2 ~a10~0))) (.cse7 (<= ~a19~0 8)) (.cse0 (= 9 |old(~a19~0)|))) (or (and (= ~a1~0 |old(~a1~0)|) (= ~a19~0 |old(~a19~0)|) (= |old(~a10~0)| ~a10~0)) (< |old(~a1~0)| 23) (and (<= ~a10~0 0) .cse0 .cse1) (and (= 1 ~a10~0) .cse0 .cse1) (and (not (= ~a10~0 3)) (and .cse2 .cse0 .cse3) (exists ((v_prenex_4 Int)) (let ((.cse5 (* 9 v_prenex_4))) (let ((.cse4 (div .cse5 10))) (and (<= ~a1~0 (+ (mod .cse4 25) 12)) (<= 0 .cse4) (<= 0 .cse5))))) .cse1) (and .cse6 .cse7 (not (= ~a10~0 1)) .cse3 .cse8) (and .cse9 (and (= 8 ~a19~0) (= |old(~a19~0)| 9))) (not (= 0 ~a12~0)) (and .cse6 .cse0 .cse1 .cse8) (= 10 |old(~a19~0)|) (not (= 14 ~a4~0)) (= 8 |old(~a19~0)|) (and .cse1 (and .cse9 .cse2 .cse0 .cse3)) (< 23 |old(~a1~0)|) (and .cse7 .cse0 .cse8) (< 0 |old(~a10~0)|) (and .cse7 (not (= ~a19~0 8)) .cse0))) [2018-11-10 11:51:33,616 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-10 11:51:33,616 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-10 11:51:33,616 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-11-10 11:51:33,617 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse6 (= |old(~a19~0)| ~a19~0)) (.cse1 (or (= 0 |old(~a10~0)|) (<= (+ |old(~a1~0)| 13) 0))) (.cse9 (< 218 ~a1~0)) (.cse2 (not (= ~a19~0 10))) (.cse3 (not (= ~a10~0 4))) (.cse8 (not (= 2 ~a10~0))) (.cse7 (<= ~a19~0 8)) (.cse0 (= 9 |old(~a19~0)|))) (or (and (= ~a1~0 |old(~a1~0)|) (= ~a19~0 |old(~a19~0)|) (= |old(~a10~0)| ~a10~0)) (< |old(~a1~0)| 23) (and (<= ~a10~0 0) .cse0 .cse1) (and (= 1 ~a10~0) .cse0 .cse1) (and (not (= ~a10~0 3)) (and .cse2 .cse0 .cse3) (exists ((v_prenex_4 Int)) (let ((.cse5 (* 9 v_prenex_4))) (let ((.cse4 (div .cse5 10))) (and (<= ~a1~0 (+ (mod .cse4 25) 12)) (<= 0 .cse4) (<= 0 .cse5))))) .cse1) (and .cse6 .cse7 (not (= ~a10~0 1)) .cse3 .cse8) (and .cse9 (and (= 8 ~a19~0) (= |old(~a19~0)| 9))) (not (= 0 ~a12~0)) (and .cse6 .cse0 .cse1 .cse8) (= 10 |old(~a19~0)|) (not (= 14 ~a4~0)) (= 8 |old(~a19~0)|) (and .cse1 (and .cse9 .cse2 .cse0 .cse3)) (< 23 |old(~a1~0)|) (and .cse7 .cse0 .cse8) (< 0 |old(~a10~0)|) (and .cse7 (not (= ~a19~0 8)) .cse0))) [2018-11-10 11:51:33,617 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-11-10 11:51:33,622 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-10 11:51:33,623 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-10 11:51:33,623 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-10 11:51:33,630 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-10 11:51:33,631 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-10 11:51:33,631 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-10 11:51:33,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:51:33 BoogieIcfgContainer [2018-11-10 11:51:33,634 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 11:51:33,634 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:51:33,634 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:51:33,634 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:51:33,635 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:50:56" (3/4) ... [2018-11-10 11:51:33,638 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 11:51:33,645 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 11:51:33,645 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-10 11:51:33,645 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 11:51:33,655 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 11:51:33,656 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 11:51:33,679 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((a1 == \old(a1) && a19 == \old(a19)) && \old(a10) == a10) || \old(a1) < 23) || ((a10 <= 0 && 9 == \old(a19)) && (0 == \old(a10) || \old(a1) + 13 <= 0))) || ((1 == a10 && 9 == \old(a19)) && (0 == \old(a10) || \old(a1) + 13 <= 0))) || (((!(a10 == 3) && (!(a19 == 10) && 9 == \old(a19)) && !(a10 == 4)) && (\exists v_prenex_4 : int :: (a1 <= 9 * v_prenex_4 / 10 % 25 + 12 && 0 <= 9 * v_prenex_4 / 10) && 0 <= 9 * v_prenex_4)) && (0 == \old(a10) || \old(a1) + 13 <= 0))) || ((((\old(a19) == a19 && a19 <= 8) && !(a10 == 1)) && !(a10 == 4)) && !(2 == a10))) || (218 < a1 && 8 == a19 && \old(a19) == 9)) || !(0 == a12)) || (((\old(a19) == a19 && 9 == \old(a19)) && (0 == \old(a10) || \old(a1) + 13 <= 0)) && !(2 == a10))) || 10 == \old(a19)) || !(14 == a4)) || 8 == \old(a19)) || ((0 == \old(a10) || \old(a1) + 13 <= 0) && ((218 < a1 && !(a19 == 10)) && 9 == \old(a19)) && !(a10 == 4))) || 23 < \old(a1)) || ((a19 <= 8 && 9 == \old(a19)) && !(2 == a10))) || 0 < \old(a10)) || ((a19 <= 8 && !(a19 == 8)) && 9 == \old(a19)) [2018-11-10 11:51:33,745 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cab72161-a79a-46ee-9880-0dd0b48d58c6/bin-2019/uautomizer/witness.graphml [2018-11-10 11:51:33,746 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:51:33,746 INFO L168 Benchmark]: Toolchain (without parser) took 38930.22 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 647.5 MB). Free memory was 957.6 MB in the beginning and 1.3 GB in the end (delta: -373.5 MB). Peak memory consumption was 274.0 MB. Max. memory is 11.5 GB. [2018-11-10 11:51:33,747 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:51:33,747 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.02 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 925.4 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-10 11:51:33,748 INFO L168 Benchmark]: Boogie Preprocessor took 127.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 925.4 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-11-10 11:51:33,749 INFO L168 Benchmark]: RCFGBuilder took 950.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 106.9 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:51:33,749 INFO L168 Benchmark]: TraceAbstraction took 37386.19 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 521.7 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -335.2 MB). Peak memory consumption was 697.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:51:33,749 INFO L168 Benchmark]: Witness Printer took 111.48 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:51:33,750 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 351.02 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 925.4 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 127.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 925.4 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 950.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 106.9 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37386.19 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 521.7 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -335.2 MB). Peak memory consumption was 697.9 MB. Max. memory is 11.5 GB. * Witness Printer took 111.48 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 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_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 70]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant [2018-11-10 11:51:33,753 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-10 11:51:33,753 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-10 11:51:33,754 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-10 11:51:33,755 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-10 11:51:33,755 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-10 11:51:33,755 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] Derived loop invariant: (((((((((((((((((a1 == \old(a1) && a19 == \old(a19)) && \old(a10) == a10) || \old(a1) < 23) || ((a10 <= 0 && 9 == \old(a19)) && (0 == \old(a10) || \old(a1) + 13 <= 0))) || ((1 == a10 && 9 == \old(a19)) && (0 == \old(a10) || \old(a1) + 13 <= 0))) || (((!(a10 == 3) && (!(a19 == 10) && 9 == \old(a19)) && !(a10 == 4)) && (\exists v_prenex_4 : int :: (a1 <= 9 * v_prenex_4 / 10 % 25 + 12 && 0 <= 9 * v_prenex_4 / 10) && 0 <= 9 * v_prenex_4)) && (0 == \old(a10) || \old(a1) + 13 <= 0))) || ((((\old(a19) == a19 && a19 <= 8) && !(a10 == 1)) && !(a10 == 4)) && !(2 == a10))) || (218 < a1 && 8 == a19 && \old(a19) == 9)) || !(0 == a12)) || (((\old(a19) == a19 && 9 == \old(a19)) && (0 == \old(a10) || \old(a1) + 13 <= 0)) && !(2 == a10))) || 10 == \old(a19)) || !(14 == a4)) || 8 == \old(a19)) || ((0 == \old(a10) || \old(a1) + 13 <= 0) && ((218 < a1 && !(a19 == 10)) && 9 == \old(a19)) && !(a10 == 4))) || 23 < \old(a1)) || ((a19 <= 8 && 9 == \old(a19)) && !(2 == a10))) || 0 < \old(a10)) || ((a19 <= 8 && !(a19 == 8)) && 9 == \old(a19)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 37.3s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 25.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 875 SDtfs, 13525 SDslu, 1927 SDs, 0 SdLazy, 25838 SolverSat, 4185 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 19.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2042 GetRequests, 1794 SyntacticMatches, 16 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2914 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2859occurred in iteration=8, 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: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1675 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 158 PreInvPairs, 250 NumberOfFragments, 769 HoareAnnotationTreeSize, 158 FomulaSimplifications, 69941 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 11298 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 3969 NumberOfCodeBlocks, 3969 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3952 ConstructedInterpolants, 25 QuantifiedInterpolants, 5255972 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2817 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 1932/2468 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...