./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label56_true-unreach-call_false-termination.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_76135c80-db86-4a12-8411-9f44f9dae017/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_76135c80-db86-4a12-8411-9f44f9dae017/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_76135c80-db86-4a12-8411-9f44f9dae017/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_76135c80-db86-4a12-8411-9f44f9dae017/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label56_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_76135c80-db86-4a12-8411-9f44f9dae017/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_76135c80-db86-4a12-8411-9f44f9dae017/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 ba14f37e794170b10f4bcc13681acbd0ae9fe016 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:35:33,061 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:35:33,062 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:35:33,071 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:35:33,071 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:35:33,072 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:35:33,073 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:35:33,074 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:35:33,075 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:35:33,076 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:35:33,076 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:35:33,076 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:35:33,077 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:35:33,078 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:35:33,079 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:35:33,079 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:35:33,080 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:35:33,081 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:35:33,082 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:35:33,083 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:35:33,084 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:35:33,085 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:35:33,086 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:35:33,087 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:35:33,087 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:35:33,087 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:35:33,088 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:35:33,089 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:35:33,089 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:35:33,090 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:35:33,090 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:35:33,091 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:35:33,091 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:35:33,091 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:35:33,092 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:35:33,092 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:35:33,092 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_76135c80-db86-4a12-8411-9f44f9dae017/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 12:35:33,099 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:35:33,100 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:35:33,100 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:35:33,100 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:35:33,101 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:35:33,101 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:35:33,101 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:35:33,101 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:35:33,101 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:35:33,101 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:35:33,102 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:35:33,102 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:35:33,102 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:35:33,102 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:35:33,102 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:35:33,102 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:35:33,102 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:35:33,102 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:35:33,103 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:35:33,103 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:35:33,103 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:35:33,103 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:35:33,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:35:33,103 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:35:33,103 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:35:33,104 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:35:33,104 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:35:33,104 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:35:33,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:35:33,104 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_76135c80-db86-4a12-8411-9f44f9dae017/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 -> ba14f37e794170b10f4bcc13681acbd0ae9fe016 [2018-11-10 12:35:33,128 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:35:33,137 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:35:33,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:35:33,141 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:35:33,141 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:35:33,142 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_76135c80-db86-4a12-8411-9f44f9dae017/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label56_true-unreach-call_false-termination.c [2018-11-10 12:35:33,189 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_76135c80-db86-4a12-8411-9f44f9dae017/bin-2019/uautomizer/data/5b80d91a7/9163e1d145ea42689734e51cd5527cff/FLAGca842f7c6 [2018-11-10 12:35:33,647 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:35:33,647 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_76135c80-db86-4a12-8411-9f44f9dae017/sv-benchmarks/c/eca-rers2012/Problem02_label56_true-unreach-call_false-termination.c [2018-11-10 12:35:33,658 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_76135c80-db86-4a12-8411-9f44f9dae017/bin-2019/uautomizer/data/5b80d91a7/9163e1d145ea42689734e51cd5527cff/FLAGca842f7c6 [2018-11-10 12:35:33,669 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_76135c80-db86-4a12-8411-9f44f9dae017/bin-2019/uautomizer/data/5b80d91a7/9163e1d145ea42689734e51cd5527cff [2018-11-10 12:35:33,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:35:33,673 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 12:35:33,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:35:33,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:35:33,677 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:35:33,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:35:33" (1/1) ... [2018-11-10 12:35:33,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12305cee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:33, skipping insertion in model container [2018-11-10 12:35:33,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:35:33" (1/1) ... [2018-11-10 12:35:33,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:35:33,721 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:35:33,981 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:35:33,984 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:35:34,052 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:35:34,064 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:35:34,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:34 WrapperNode [2018-11-10 12:35:34,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:35:34,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:35:34,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:35:34,065 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:35:34,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:34" (1/1) ... [2018-11-10 12:35:34,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:34" (1/1) ... [2018-11-10 12:35:34,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:34" (1/1) ... [2018-11-10 12:35:34,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:34" (1/1) ... [2018-11-10 12:35:34,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:34" (1/1) ... [2018-11-10 12:35:34,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:34" (1/1) ... [2018-11-10 12:35:34,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:34" (1/1) ... [2018-11-10 12:35:34,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:35:34,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:35:34,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:35:34,182 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:35:34,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76135c80-db86-4a12-8411-9f44f9dae017/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 12:35:34,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:35:34,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:35:34,217 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-10 12:35:34,217 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:35:34,217 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-10 12:35:34,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 12:35:34,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 12:35:34,217 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 12:35:34,218 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:35:34,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:35:34,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:35:34,996 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:35:34,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:35:34 BoogieIcfgContainer [2018-11-10 12:35:34,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:35:34,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:35:34,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:35:35,001 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:35:35,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:35:33" (1/3) ... [2018-11-10 12:35:35,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544e380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:35:35, skipping insertion in model container [2018-11-10 12:35:35,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:34" (2/3) ... [2018-11-10 12:35:35,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544e380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:35:35, skipping insertion in model container [2018-11-10 12:35:35,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:35:34" (3/3) ... [2018-11-10 12:35:35,004 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label56_true-unreach-call_false-termination.c [2018-11-10 12:35:35,010 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:35:35,016 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:35:35,027 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:35:35,050 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:35:35,051 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:35:35,051 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:35:35,051 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:35:35,051 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:35:35,051 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:35:35,051 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:35:35,051 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:35:35,052 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:35:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-10 12:35:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 12:35:35,079 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:35,079 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:35:35,081 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:35,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:35,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1901339872, now seen corresponding path program 1 times [2018-11-10 12:35:35,087 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:35:35,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:35:35,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:35,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:35,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:35,393 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 12:35:35,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:35:35,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:35:35,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:35:35,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:35:35,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:35:35,411 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-10 12:35:36,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:36,067 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-11-10 12:35:36,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:35:36,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2018-11-10 12:35:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:36,079 INFO L225 Difference]: With dead ends: 621 [2018-11-10 12:35:36,079 INFO L226 Difference]: Without dead ends: 382 [2018-11-10 12:35:36,084 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 12:35:36,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-10 12:35:36,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-10 12:35:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-10 12:35:36,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-11-10 12:35:36,148 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 130 [2018-11-10 12:35:36,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:36,149 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-11-10 12:35:36,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:35:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-11-10 12:35:36,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 12:35:36,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:36,154 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 12:35:36,154 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:36,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:36,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1819679469, now seen corresponding path program 1 times [2018-11-10 12:35:36,155 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:35:36,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:35:36,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:36,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:36,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:35:36,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:35:36,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:35:36,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:35:36,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:35:36,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:35:36,421 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-11-10 12:35:36,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:36,939 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-11-10 12:35:36,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:35:36,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2018-11-10 12:35:36,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:36,941 INFO L225 Difference]: With dead ends: 903 [2018-11-10 12:35:36,941 INFO L226 Difference]: Without dead ends: 381 [2018-11-10 12:35:36,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:35:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-10 12:35:36,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-10 12:35:36,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-10 12:35:36,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-11-10 12:35:36,955 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 139 [2018-11-10 12:35:36,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:36,956 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-11-10 12:35:36,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:35:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-11-10 12:35:36,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-10 12:35:36,957 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:36,958 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 12:35:36,958 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:36,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:36,958 INFO L82 PathProgramCache]: Analyzing trace with hash 484067553, now seen corresponding path program 1 times [2018-11-10 12:35:36,958 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:35:36,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:35:36,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:36,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:36,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:37,164 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:35:37,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:35:37,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:35:37,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:35:37,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:35:37,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:35:37,165 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-11-10 12:35:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:37,654 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-11-10 12:35:37,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:35:37,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2018-11-10 12:35:37,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:37,657 INFO L225 Difference]: With dead ends: 901 [2018-11-10 12:35:37,657 INFO L226 Difference]: Without dead ends: 380 [2018-11-10 12:35:37,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:35:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-10 12:35:37,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-10 12:35:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-10 12:35:37,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-11-10 12:35:37,670 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 145 [2018-11-10 12:35:37,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:37,670 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-11-10 12:35:37,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:35:37,670 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-11-10 12:35:37,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 12:35:37,673 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:37,673 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 12:35:37,674 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:37,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:37,674 INFO L82 PathProgramCache]: Analyzing trace with hash 191966186, now seen corresponding path program 1 times [2018-11-10 12:35:37,674 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:35:37,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:35:37,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:37,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:37,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:37,770 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:35:37,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:35:37,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:35:37,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:35:37,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:35:37,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:35:37,772 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-11-10 12:35:38,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:38,690 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-11-10 12:35:38,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:35:38,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2018-11-10 12:35:38,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:38,695 INFO L225 Difference]: With dead ends: 1193 [2018-11-10 12:35:38,695 INFO L226 Difference]: Without dead ends: 819 [2018-11-10 12:35:38,697 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 12:35:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-10 12:35:38,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-11-10 12:35:38,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-11-10 12:35:38,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-11-10 12:35:38,721 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 153 [2018-11-10 12:35:38,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:38,722 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-11-10 12:35:38,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:35:38,722 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-11-10 12:35:38,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 12:35:38,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:38,725 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] [2018-11-10 12:35:38,725 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:38,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:38,725 INFO L82 PathProgramCache]: Analyzing trace with hash -684578330, now seen corresponding path program 1 times [2018-11-10 12:35:38,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:35:38,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:35:38,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:38,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:38,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:38,890 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 12:35:38,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:35:38,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:35:38,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:35:38,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:35:38,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:35:38,891 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-11-10 12:35:39,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:39,651 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-11-10 12:35:39,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:35:39,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2018-11-10 12:35:39,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:39,656 INFO L225 Difference]: With dead ends: 1753 [2018-11-10 12:35:39,656 INFO L226 Difference]: Without dead ends: 804 [2018-11-10 12:35:39,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:35:39,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-10 12:35:39,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-11-10 12:35:39,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-11-10 12:35:39,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-11-10 12:35:39,678 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 155 [2018-11-10 12:35:39,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:39,678 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-11-10 12:35:39,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:35:39,678 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-11-10 12:35:39,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-10 12:35:39,681 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:39,682 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:35:39,682 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:39,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:39,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1228371938, now seen corresponding path program 1 times [2018-11-10 12:35:39,682 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:35:39,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:35:39,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:39,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:39,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:35:39,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:35:39,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:35:39,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:35:39,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:35:39,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:35:39,853 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-11-10 12:35:40,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:40,374 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-11-10 12:35:40,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:35:40,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2018-11-10 12:35:40,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:40,379 INFO L225 Difference]: With dead ends: 1747 [2018-11-10 12:35:40,379 INFO L226 Difference]: Without dead ends: 801 [2018-11-10 12:35:40,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:35:40,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-10 12:35:40,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-10 12:35:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-10 12:35:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-11-10 12:35:40,400 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 157 [2018-11-10 12:35:40,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:40,401 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-11-10 12:35:40,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:35:40,401 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-11-10 12:35:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 12:35:40,403 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:40,404 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:35:40,404 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:40,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:40,404 INFO L82 PathProgramCache]: Analyzing trace with hash -977337382, now seen corresponding path program 1 times [2018-11-10 12:35:40,404 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:35:40,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:35:40,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:40,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:40,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:35:40,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:35:40,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:35:40,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:35:40,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:35:40,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:35:40,490 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-11-10 12:35:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:41,213 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-11-10 12:35:41,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:35:41,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2018-11-10 12:35:41,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:41,220 INFO L225 Difference]: With dead ends: 2381 [2018-11-10 12:35:41,220 INFO L226 Difference]: Without dead ends: 1586 [2018-11-10 12:35:41,224 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 12:35:41,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-11-10 12:35:41,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-11-10 12:35:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-10 12:35:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-11-10 12:35:41,257 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 161 [2018-11-10 12:35:41,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:41,258 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-11-10 12:35:41,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:35:41,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-11-10 12:35:41,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-10 12:35:41,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:41,288 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:35:41,288 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:41,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:41,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1994030385, now seen corresponding path program 1 times [2018-11-10 12:35:41,289 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:35:41,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:35:41,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:41,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:41,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:35:41,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:35:41,469 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76135c80-db86-4a12-8411-9f44f9dae017/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 12:35:41,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:41,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:35:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 12:35:41,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:35:41,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2018-11-10 12:35:41,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 12:35:41,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:35:41,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:35:41,627 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 10 states. [2018-11-10 12:35:43,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:43,825 INFO L93 Difference]: Finished difference Result 6541 states and 10916 transitions. [2018-11-10 12:35:43,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 12:35:43,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 167 [2018-11-10 12:35:43,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:43,839 INFO L225 Difference]: With dead ends: 6541 [2018-11-10 12:35:43,839 INFO L226 Difference]: Without dead ends: 2806 [2018-11-10 12:35:43,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-10 12:35:43,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2018-11-10 12:35:43,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2778. [2018-11-10 12:35:43,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2778 states. [2018-11-10 12:35:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 4061 transitions. [2018-11-10 12:35:43,953 INFO L78 Accepts]: Start accepts. Automaton has 2778 states and 4061 transitions. Word has length 167 [2018-11-10 12:35:43,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:43,953 INFO L481 AbstractCegarLoop]: Abstraction has 2778 states and 4061 transitions. [2018-11-10 12:35:43,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 12:35:43,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 4061 transitions. [2018-11-10 12:35:43,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-10 12:35:43,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:43,961 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:35:43,962 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:43,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:43,962 INFO L82 PathProgramCache]: Analyzing trace with hash -396743574, now seen corresponding path program 1 times [2018-11-10 12:35:43,962 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:35:43,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:35:43,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:43,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:43,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:44,047 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:35:44,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:35:44,048 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76135c80-db86-4a12-8411-9f44f9dae017/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 12:35:44,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:44,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:35:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 12:35:44,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:35:44,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-10 12:35:44,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:35:44,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:35:44,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:35:44,162 INFO L87 Difference]: Start difference. First operand 2778 states and 4061 transitions. Second operand 7 states. [2018-11-10 12:35:45,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:45,044 INFO L93 Difference]: Finished difference Result 7200 states and 10148 transitions. [2018-11-10 12:35:45,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 12:35:45,044 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 199 [2018-11-10 12:35:45,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:45,056 INFO L225 Difference]: With dead ends: 7200 [2018-11-10 12:35:45,056 INFO L226 Difference]: Without dead ends: 4428 [2018-11-10 12:35:45,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-11-10 12:35:45,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4428 states. [2018-11-10 12:35:45,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4428 to 4220. [2018-11-10 12:35:45,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4220 states. [2018-11-10 12:35:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4220 states to 4220 states and 5166 transitions. [2018-11-10 12:35:45,131 INFO L78 Accepts]: Start accepts. Automaton has 4220 states and 5166 transitions. Word has length 199 [2018-11-10 12:35:45,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:45,131 INFO L481 AbstractCegarLoop]: Abstraction has 4220 states and 5166 transitions. [2018-11-10 12:35:45,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:35:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 4220 states and 5166 transitions. [2018-11-10 12:35:45,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-11-10 12:35:45,137 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:45,137 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:35:45,137 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:45,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:45,137 INFO L82 PathProgramCache]: Analyzing trace with hash -178987568, now seen corresponding path program 1 times [2018-11-10 12:35:45,138 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:35:45,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:35:45,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:45,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:45,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 143 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:35:45,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:35:45,309 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_76135c80-db86-4a12-8411-9f44f9dae017/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 12:35:45,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:45,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:35:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 158 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 12:35:45,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:35:45,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2018-11-10 12:35:45,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 12:35:45,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 12:35:45,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-11-10 12:35:45,459 INFO L87 Difference]: Start difference. First operand 4220 states and 5166 transitions. Second operand 14 states. [2018-11-10 12:35:46,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:46,539 INFO L93 Difference]: Finished difference Result 6631 states and 8002 transitions. [2018-11-10 12:35:46,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 12:35:46,540 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 248 [2018-11-10 12:35:46,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:46,540 INFO L225 Difference]: With dead ends: 6631 [2018-11-10 12:35:46,540 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 12:35:46,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2018-11-10 12:35:46,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 12:35:46,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 12:35:46,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 12:35:46,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:35:46,551 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 248 [2018-11-10 12:35:46,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:46,551 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:35:46,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 12:35:46,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:35:46,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 12:35:46,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 12:35:46,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:35:46,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:35:46,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:35:46,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:35:46,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:35:46,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:35:46,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:35:46,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:35:46,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:35:46,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:35:46,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:35:46,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:35:46,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:35:46,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:35:46,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:35:46,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:35:47,108 WARN L179 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 80 [2018-11-10 12:35:47,327 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2018-11-10 12:35:47,585 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2018-11-10 12:35:47,587 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 12:35:47,587 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a17~0)| ~a17~0) (= |old(~a25~0)| ~a25~0) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|)) [2018-11-10 12:35:47,587 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:35:47,587 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,587 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,587 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,587 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,587 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,587 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-10 12:35:47,587 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-10 12:35:47,588 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-10 12:35:47,588 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-10 12:35:47,588 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-10 12:35:47,588 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-10 12:35:47,588 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-10 12:35:47,588 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-10 12:35:47,588 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-10 12:35:47,588 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-10 12:35:47,588 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-10 12:35:47,588 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-10 12:35:47,588 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-10 12:35:47,588 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,588 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,588 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,588 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,589 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,589 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-10 12:35:47,589 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-10 12:35:47,589 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-10 12:35:47,589 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-10 12:35:47,589 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-10 12:35:47,589 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-10 12:35:47,589 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-10 12:35:47,589 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-10 12:35:47,589 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-10 12:35:47,589 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-10 12:35:47,589 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-10 12:35:47,589 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-10 12:35:47,589 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-10 12:35:47,589 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-10 12:35:47,590 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-10 12:35:47,590 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-10 12:35:47,590 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,590 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,590 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,590 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,590 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,590 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-10 12:35:47,590 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-10 12:35:47,590 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-10 12:35:47,590 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-10 12:35:47,590 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-10 12:35:47,590 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-10 12:35:47,590 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-10 12:35:47,590 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-10 12:35:47,590 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-10 12:35:47,591 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-10 12:35:47,591 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-10 12:35:47,591 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,591 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,591 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,591 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,591 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,591 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-10 12:35:47,591 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-10 12:35:47,591 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-10 12:35:47,591 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-10 12:35:47,591 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-10 12:35:47,591 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-10 12:35:47,591 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-10 12:35:47,591 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-10 12:35:47,592 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-10 12:35:47,592 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-10 12:35:47,592 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-10 12:35:47,592 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-10 12:35:47,592 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-10 12:35:47,592 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,592 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,592 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,592 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,592 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,592 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-10 12:35:47,592 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-10 12:35:47,592 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-10 12:35:47,592 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-10 12:35:47,592 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-10 12:35:47,593 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-10 12:35:47,593 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-10 12:35:47,593 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-10 12:35:47,593 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-10 12:35:47,593 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-10 12:35:47,593 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-10 12:35:47,593 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-10 12:35:47,593 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-10 12:35:47,593 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-10 12:35:47,593 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-10 12:35:47,593 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-10 12:35:47,593 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,593 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,593 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,593 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,593 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,594 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-10 12:35:47,594 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-10 12:35:47,594 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,594 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-10 12:35:47,594 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-10 12:35:47,594 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-10 12:35:47,594 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,594 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,594 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-10 12:35:47,594 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-10 12:35:47,594 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-10 12:35:47,594 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-10 12:35:47,594 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-10 12:35:47,594 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-10 12:35:47,594 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-10 12:35:47,595 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-10 12:35:47,595 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-10 12:35:47,595 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-10 12:35:47,595 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-10 12:35:47,595 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,595 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,595 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,595 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,595 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,595 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,595 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-10 12:35:47,595 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-10 12:35:47,595 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-10 12:35:47,595 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-10 12:35:47,595 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-10 12:35:47,595 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-10 12:35:47,596 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-10 12:35:47,596 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-10 12:35:47,596 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-10 12:35:47,596 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-10 12:35:47,596 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-10 12:35:47,596 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,596 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,596 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,596 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,596 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,596 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,596 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-10 12:35:47,596 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-10 12:35:47,596 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-10 12:35:47,596 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-10 12:35:47,597 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-10 12:35:47,597 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-10 12:35:47,597 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-10 12:35:47,597 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-10 12:35:47,597 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-10 12:35:47,597 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-10 12:35:47,597 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-10 12:35:47,597 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-10 12:35:47,597 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-10 12:35:47,597 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-10 12:35:47,597 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,597 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,597 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,597 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,598 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse7 (= 1 |old(~a19~0)|)) (.cse23 (= |old(~a17~0)| ~a17~0)) (.cse12 (= |old(~a25~0)| ~a25~0)) (.cse20 (= ~a19~0 |old(~a19~0)|)) (.cse21 (= ~a28~0 |old(~a28~0)|)) (.cse15 (not (= ~a11~0 1))) (.cse14 (= 1 |old(~a11~0)|)) (.cse11 (= 1 |old(~a25~0)|)) (.cse19 (= 9 |old(~a28~0)|))) (let ((.cse9 (= 8 ~a17~0)) (.cse3 (not (= 8 |old(~a17~0)|))) (.cse5 (not .cse19)) (.cse8 (not (= 7 |old(~a28~0)|))) (.cse1 (not .cse11)) (.cse6 (not .cse14)) (.cse4 (= 1 ~a11~0)) (.cse10 (= 1 ~a19~0)) (.cse13 (not (= 7 |old(~a17~0)|))) (.cse18 (and .cse23 .cse12 .cse20 .cse21 .cse15)) (.cse0 (not (= 1 ~a21~0))) (.cse22 (< 7 |old(~a28~0)|)) (.cse2 (not .cse7)) (.cse17 (and .cse23 .cse12 .cse20 .cse21)) (.cse16 (not (= |old(~a17~0)| 8)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse8 .cse3 (and (= 7 ~a28~0) (not (= ~a25~0 1)) .cse4 .cse9 (not .cse10)) .cse6 .cse11) (or (and .cse4 .cse9 .cse10 .cse12 (= 10 ~a28~0)) .cse0 (not (= 10 |old(~a28~0)|)) .cse1 .cse2 .cse3 .cse6) (or .cse0 (and (= |old(~a28~0)| ~a28~0) (= 7 ~a17~0) .cse12) .cse13) (or .cse0 .cse14 .cse15 .cse2 .cse16) (or .cse0 .cse2 .cse17 .cse16 .cse5) (or .cse0 .cse14 .cse18 (= 8 |old(~a28~0)|) .cse19 .cse16) (or .cse0 .cse14 .cse15 .cse13) (or .cse0 .cse8 .cse1 .cse2 .cse6 (and .cse4 .cse10) .cse13) (or (and .cse12 .cse15 (= ~a17~0 |old(~a17~0)|) .cse20 .cse21) .cse0 .cse22 .cse14 .cse2 (= |old(~a17~0)| |old(~a28~0)|) (< 8 |old(~a17~0)|) .cse11) (or .cse0 .cse14 .cse17 .cse2 .cse16) (or .cse0 .cse14 .cse19 .cse18 .cse16 .cse11) (or .cse0 .cse22 .cse2 .cse17 .cse16)))) [2018-11-10 12:35:47,598 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,598 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,598 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-10 12:35:47,598 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-10 12:35:47,598 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-10 12:35:47,598 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-10 12:35:47,598 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-10 12:35:47,599 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-10 12:35:47,599 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-10 12:35:47,599 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-10 12:35:47,599 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-10 12:35:47,599 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-10 12:35:47,599 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-10 12:35:47,599 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-10 12:35:47,599 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-10 12:35:47,599 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,599 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,599 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,599 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,599 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,599 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,599 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-10 12:35:47,600 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-10 12:35:47,600 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-10 12:35:47,600 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-10 12:35:47,600 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-10 12:35:47,600 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-10 12:35:47,600 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-10 12:35:47,600 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-10 12:35:47,600 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-10 12:35:47,600 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-10 12:35:47,600 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-10 12:35:47,600 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-10 12:35:47,600 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-10 12:35:47,600 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-10 12:35:47,601 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 541) no Hoare annotation was computed. [2018-11-10 12:35:47,601 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-10 12:35:47,601 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-10 12:35:47,601 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,601 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,601 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,601 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,601 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-10 12:35:47,601 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-10 12:35:47,601 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-10 12:35:47,601 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-10 12:35:47,601 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-10 12:35:47,601 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-10 12:35:47,601 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-10 12:35:47,601 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-10 12:35:47,602 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-10 12:35:47,602 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-10 12:35:47,602 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-10 12:35:47,602 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-10 12:35:47,602 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-10 12:35:47,602 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-10 12:35:47,602 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-10 12:35:47,602 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-10 12:35:47,602 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-10 12:35:47,602 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-10 12:35:47,602 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-10 12:35:47,602 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-10 12:35:47,602 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:35:47,602 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~a28~0 7) (not (= ~a28~0 ~a17~0)) (not (= ~a25~0 1)) (= 1 ~a19~0) (= ~a21~0 1) (<= ~a17~0 8) (not (= ~a11~0 1))) [2018-11-10 12:35:47,603 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 12:35:47,603 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 12:35:47,603 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (and (= |old(~a25~0)| ~a25~0) (not (= ~a11~0 1)) (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|)) (not (= 1 ~a21~0)) (< 7 |old(~a28~0)|) (= 1 |old(~a11~0)|) (not (= 1 |old(~a19~0)|)) (= |old(~a17~0)| |old(~a28~0)|) (< 8 |old(~a17~0)|) (= 1 |old(~a25~0)|)) [2018-11-10 12:35:47,603 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-10 12:35:47,603 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse9 (= 9 ~a28~0)) (.cse5 (= 1 ~a11~0)) (.cse8 (= 1 ~a25~0)) (.cse6 (= 8 ~a17~0)) (.cse2 (= 1 ~a19~0)) (.cse0 (= |old(~a28~0)| 7)) (.cse4 (not (= ~a25~0 1))) (.cse1 (= |old(~a17~0)| ~a17~0)) (.cse7 (not (= ~a11~0 1))) (.cse3 (= 8 |old(~a17~0)|)) (.cse10 (not (= ~a28~0 9)))) (or (not (= 1 ~a21~0)) (< 7 |old(~a28~0)|) (and .cse0 (<= ~a28~0 7) .cse1 .cse2 .cse3) (= 7 ~a17~0) (and (= 7 ~a28~0) .cse4 .cse5 .cse6 (not .cse2)) (= 1 |old(~a25~0)|) (= 1 |old(~a11~0)|) (and (and .cse0 .cse2 .cse3 .cse7) .cse1) (= |old(~a17~0)| |old(~a28~0)|) (and .cse5 .cse8 .cse9 .cse6 .cse2) (and .cse0 .cse1 (not (= ~a28~0 8)) .cse3 .cse7 .cse10) (and .cse1 (and .cse4 .cse7) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3) (not (= 1 |old(~a19~0)|)) (and .cse5 .cse8 .cse6 .cse2 (= 10 ~a28~0)) (< 8 |old(~a17~0)|) (and .cse0 .cse4 .cse1 .cse7 .cse3 .cse10))) [2018-11-10 12:35:47,603 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-10 12:35:47,603 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-10 12:35:47,603 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse9 (= 9 ~a28~0)) (.cse5 (= 1 ~a11~0)) (.cse8 (= 1 ~a25~0)) (.cse6 (= 8 ~a17~0)) (.cse2 (= 1 ~a19~0)) (.cse0 (= |old(~a28~0)| 7)) (.cse4 (not (= ~a25~0 1))) (.cse1 (= |old(~a17~0)| ~a17~0)) (.cse7 (not (= ~a11~0 1))) (.cse3 (= 8 |old(~a17~0)|)) (.cse10 (not (= ~a28~0 9)))) (or (not (= 1 ~a21~0)) (< 7 |old(~a28~0)|) (and .cse0 (<= ~a28~0 7) .cse1 .cse2 .cse3) (= 7 ~a17~0) (and (= 7 ~a28~0) .cse4 .cse5 .cse6 (not .cse2)) (= 1 |old(~a25~0)|) (= 1 |old(~a11~0)|) (and (and .cse0 .cse2 .cse3 .cse7) .cse1) (= |old(~a17~0)| |old(~a28~0)|) (and .cse5 .cse8 .cse9 .cse6 .cse2) (and .cse0 .cse1 (not (= ~a28~0 8)) .cse3 .cse7 .cse10) (and .cse1 (and .cse4 .cse7) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3) (not (= 1 |old(~a19~0)|)) (and .cse5 .cse8 .cse6 .cse2 (= 10 ~a28~0)) (< 8 |old(~a17~0)|) (and .cse0 .cse4 .cse1 .cse7 .cse3 .cse10))) [2018-11-10 12:35:47,604 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-10 12:35:47,604 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-10 12:35:47,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:35:47 BoogieIcfgContainer [2018-11-10 12:35:47,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:35:47,619 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:35:47,619 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:35:47,619 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:35:47,620 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:35:34" (3/4) ... [2018-11-10 12:35:47,623 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 12:35:47,630 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 12:35:47,630 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-10 12:35:47,630 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 12:35:47,640 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 12:35:47,640 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 12:35:47,666 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(1 == a21) || 7 < \old(a28)) || ((((\old(a28) == 7 && a28 <= 7) && \old(a17) == a17) && 1 == a19) && 8 == \old(a17))) || 7 == a17) || ((((7 == a28 && !(a25 == 1)) && 1 == a11) && 8 == a17) && !(1 == a19))) || 1 == \old(a25)) || 1 == \old(a11)) || ((((\old(a28) == 7 && 1 == a19) && 8 == \old(a17)) && !(a11 == 1)) && \old(a17) == a17)) || \old(a17) == \old(a28)) || ((((1 == a11 && 1 == a25) && 9 == a28) && 8 == a17) && 1 == a19)) || (((((\old(a28) == 7 && \old(a17) == a17) && !(a28 == 8)) && 8 == \old(a17)) && !(a11 == 1)) && !(a28 == 9))) || (((\old(a17) == a17 && !(a25 == 1) && !(a11 == 1)) && a19 == \old(a19)) && a28 == \old(a28))) || ((((\old(a28) == 7 && \old(a17) == a17) && 9 == a28) && 1 == a19) && 8 == \old(a17))) || !(1 == \old(a19))) || ((((1 == a11 && 1 == a25) && 8 == a17) && 1 == a19) && 10 == a28)) || 8 < \old(a17)) || (((((\old(a28) == 7 && !(a25 == 1)) && \old(a17) == a17) && !(a11 == 1)) && 8 == \old(a17)) && !(a28 == 9)) [2018-11-10 12:35:47,733 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_76135c80-db86-4a12-8411-9f44f9dae017/bin-2019/uautomizer/witness.graphml [2018-11-10 12:35:47,733 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:35:47,734 INFO L168 Benchmark]: Toolchain (without parser) took 14061.44 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 585.6 MB). Free memory was 956.5 MB in the beginning and 1.5 GB in the end (delta: -578.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:35:47,734 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:35:47,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.04 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 921.6 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:35:47,734 INFO L168 Benchmark]: Boogie Preprocessor took 116.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 921.6 MB in the beginning and 1.2 GB in the end (delta: -238.4 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:35:47,735 INFO L168 Benchmark]: RCFGBuilder took 814.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 107.3 MB). Peak memory consumption was 107.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:35:47,735 INFO L168 Benchmark]: TraceAbstraction took 12621.54 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 414.2 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -496.9 MB). Peak memory consumption was 630.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:35:47,735 INFO L168 Benchmark]: Witness Printer took 113.63 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:35:47,737 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 391.04 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 921.6 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 116.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 921.6 MB in the beginning and 1.2 GB in the end (delta: -238.4 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 814.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 107.3 MB). Peak memory consumption was 107.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12621.54 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 414.2 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -496.9 MB). Peak memory consumption was 630.7 MB. Max. memory is 11.5 GB. * Witness Printer took 113.63 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 541]: 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: 606]: Loop Invariant Derived loop invariant: (((((((((((((((!(1 == a21) || 7 < \old(a28)) || ((((\old(a28) == 7 && a28 <= 7) && \old(a17) == a17) && 1 == a19) && 8 == \old(a17))) || 7 == a17) || ((((7 == a28 && !(a25 == 1)) && 1 == a11) && 8 == a17) && !(1 == a19))) || 1 == \old(a25)) || 1 == \old(a11)) || ((((\old(a28) == 7 && 1 == a19) && 8 == \old(a17)) && !(a11 == 1)) && \old(a17) == a17)) || \old(a17) == \old(a28)) || ((((1 == a11 && 1 == a25) && 9 == a28) && 8 == a17) && 1 == a19)) || (((((\old(a28) == 7 && \old(a17) == a17) && !(a28 == 8)) && 8 == \old(a17)) && !(a11 == 1)) && !(a28 == 9))) || (((\old(a17) == a17 && !(a25 == 1) && !(a11 == 1)) && a19 == \old(a19)) && a28 == \old(a28))) || ((((\old(a28) == 7 && \old(a17) == a17) && 9 == a28) && 1 == a19) && 8 == \old(a17))) || !(1 == \old(a19))) || ((((1 == a11 && 1 == a25) && 8 == a17) && 1 == a19) && 10 == a28)) || 8 < \old(a17)) || (((((\old(a28) == 7 && !(a25 == 1)) && \old(a17) == a17) && !(a11 == 1)) && 8 == \old(a17)) && !(a28 == 9)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 12.5s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 8.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1104 SDtfs, 8292 SDslu, 1245 SDs, 0 SdLazy, 10600 SolverSat, 2269 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 749 GetRequests, 660 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4220occurred in iteration=9, 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 276 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 143 PreInvPairs, 235 NumberOfFragments, 866 HoareAnnotationTreeSize, 143 FomulaSimplifications, 4084 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2067 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2268 NumberOfCodeBlocks, 2268 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2255 ConstructedInterpolants, 0 QuantifiedInterpolants, 1777257 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1426 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 643/694 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...