./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6bcc7ace-0aec-4237-9562-2e8a4749da9e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6bcc7ace-0aec-4237-9562-2e8a4749da9e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6bcc7ace-0aec-4237-9562-2e8a4749da9e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6bcc7ace-0aec-4237-9562-2e8a4749da9e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label08.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6bcc7ace-0aec-4237-9562-2e8a4749da9e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6bcc7ace-0aec-4237-9562-2e8a4749da9e/bin/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 44c365411dc6129e6e9156b926af4bb4824929a1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 19:02:07,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:02:07,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:02:07,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:02:07,774 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:02:07,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:02:07,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:02:07,777 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:02:07,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:02:07,780 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:02:07,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:02:07,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:02:07,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:02:07,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:02:07,784 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:02:07,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:02:07,786 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:02:07,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:02:07,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:02:07,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:02:07,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:02:07,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:02:07,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:02:07,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:02:07,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:02:07,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:02:07,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:02:07,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:02:07,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:02:07,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:02:07,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:02:07,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:02:07,799 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:02:07,800 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:02:07,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:02:07,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:02:07,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:02:07,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:02:07,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:02:07,802 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:02:07,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:02:07,803 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6bcc7ace-0aec-4237-9562-2e8a4749da9e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 19:02:07,815 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:02:07,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:02:07,815 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 19:02:07,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 19:02:07,816 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 19:02:07,816 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:02:07,816 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:02:07,816 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:02:07,816 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:02:07,816 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:02:07,816 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:02:07,817 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:02:07,817 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:02:07,817 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:02:07,817 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:02:07,817 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:02:07,817 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:02:07,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:02:07,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 19:02:07,818 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:02:07,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:02:07,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:02:07,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:02:07,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:02:07,818 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:02:07,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 19:02:07,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:02:07,819 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:02:07,819 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:02:07,819 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_6bcc7ace-0aec-4237-9562-2e8a4749da9e/bin/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 -> 44c365411dc6129e6e9156b926af4bb4824929a1 [2019-12-07 19:02:07,931 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:02:07,941 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:02:07,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:02:07,945 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:02:07,945 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:02:07,946 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6bcc7ace-0aec-4237-9562-2e8a4749da9e/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label08.c [2019-12-07 19:02:07,993 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6bcc7ace-0aec-4237-9562-2e8a4749da9e/bin/uautomizer/data/b3ef400b4/f21cdbd8e44b4cfa902a4a8931dc910e/FLAG4faa7c34d [2019-12-07 19:02:08,488 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:02:08,489 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6bcc7ace-0aec-4237-9562-2e8a4749da9e/sv-benchmarks/c/eca-rers2012/Problem03_label08.c [2019-12-07 19:02:08,501 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6bcc7ace-0aec-4237-9562-2e8a4749da9e/bin/uautomizer/data/b3ef400b4/f21cdbd8e44b4cfa902a4a8931dc910e/FLAG4faa7c34d [2019-12-07 19:02:08,510 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6bcc7ace-0aec-4237-9562-2e8a4749da9e/bin/uautomizer/data/b3ef400b4/f21cdbd8e44b4cfa902a4a8931dc910e [2019-12-07 19:02:08,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:02:08,513 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:02:08,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:02:08,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:02:08,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:02:08,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:02:08" (1/1) ... [2019-12-07 19:02:08,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@449728aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:02:08, skipping insertion in model container [2019-12-07 19:02:08,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:02:08" (1/1) ... [2019-12-07 19:02:08,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:02:08,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:02:08,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:02:08,941 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:02:09,077 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:02:09,090 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:02:09,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:02:09 WrapperNode [2019-12-07 19:02:09,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:02:09,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:02:09,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:02:09,092 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:02:09,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:02:09" (1/1) ... [2019-12-07 19:02:09,116 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:02:09" (1/1) ... [2019-12-07 19:02:09,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:02:09,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:02:09,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:02:09,169 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:02:09,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:02:09" (1/1) ... [2019-12-07 19:02:09,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:02:09" (1/1) ... [2019-12-07 19:02:09,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:02:09" (1/1) ... [2019-12-07 19:02:09,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:02:09" (1/1) ... [2019-12-07 19:02:09,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:02:09" (1/1) ... [2019-12-07 19:02:09,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:02:09" (1/1) ... [2019-12-07 19:02:09,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:02:09" (1/1) ... [2019-12-07 19:02:09,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:02:09,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:02:09,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:02:09,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:02:09,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:02:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6bcc7ace-0aec-4237-9562-2e8a4749da9e/bin/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 [2019-12-07 19:02:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:02:09,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:02:10,433 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:02:10,434 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 19:02:10,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:02:10 BoogieIcfgContainer [2019-12-07 19:02:10,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:02:10,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:02:10,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:02:10,439 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:02:10,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:02:08" (1/3) ... [2019-12-07 19:02:10,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9ea465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:02:10, skipping insertion in model container [2019-12-07 19:02:10,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:02:09" (2/3) ... [2019-12-07 19:02:10,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9ea465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:02:10, skipping insertion in model container [2019-12-07 19:02:10,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:02:10" (3/3) ... [2019-12-07 19:02:10,442 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label08.c [2019-12-07 19:02:10,450 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:02:10,457 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 19:02:10,467 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 19:02:10,492 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:02:10,492 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:02:10,492 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:02:10,493 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:02:10,493 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:02:10,493 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:02:10,493 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:02:10,493 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:02:10,511 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-12-07 19:02:10,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-07 19:02:10,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:10,522 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:10,522 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:10,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:10,526 INFO L82 PathProgramCache]: Analyzing trace with hash -576261461, now seen corresponding path program 1 times [2019-12-07 19:02:10,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:10,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571809755] [2019-12-07 19:02:10,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:02:10,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571809755] [2019-12-07 19:02:10,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:10,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:02:10,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121973814] [2019-12-07 19:02:10,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:02:10,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:10,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:02:10,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:02:10,921 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-12-07 19:02:12,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:12,218 INFO L93 Difference]: Finished difference Result 1023 states and 1861 transitions. [2019-12-07 19:02:12,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:02:12,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-12-07 19:02:12,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:12,233 INFO L225 Difference]: With dead ends: 1023 [2019-12-07 19:02:12,233 INFO L226 Difference]: Without dead ends: 654 [2019-12-07 19:02:12,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:02:12,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-12-07 19:02:12,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 652. [2019-12-07 19:02:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-12-07 19:02:12,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 964 transitions. [2019-12-07 19:02:12,293 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 964 transitions. Word has length 157 [2019-12-07 19:02:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:12,294 INFO L462 AbstractCegarLoop]: Abstraction has 652 states and 964 transitions. [2019-12-07 19:02:12,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:02:12,294 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 964 transitions. [2019-12-07 19:02:12,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 19:02:12,298 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:12,299 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:12,299 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:12,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:12,299 INFO L82 PathProgramCache]: Analyzing trace with hash 933680492, now seen corresponding path program 1 times [2019-12-07 19:02:12,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:12,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155412847] [2019-12-07 19:02:12,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:02:12,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155412847] [2019-12-07 19:02:12,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:12,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:02:12,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584710714] [2019-12-07 19:02:12,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:02:12,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:12,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:02:12,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:12,381 INFO L87 Difference]: Start difference. First operand 652 states and 964 transitions. Second operand 3 states. [2019-12-07 19:02:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:13,022 INFO L93 Difference]: Finished difference Result 1929 states and 2864 transitions. [2019-12-07 19:02:13,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:02:13,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-12-07 19:02:13,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:13,028 INFO L225 Difference]: With dead ends: 1929 [2019-12-07 19:02:13,028 INFO L226 Difference]: Without dead ends: 1279 [2019-12-07 19:02:13,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-12-07 19:02:13,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1265. [2019-12-07 19:02:13,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2019-12-07 19:02:13,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1832 transitions. [2019-12-07 19:02:13,053 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1832 transitions. Word has length 165 [2019-12-07 19:02:13,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:13,053 INFO L462 AbstractCegarLoop]: Abstraction has 1265 states and 1832 transitions. [2019-12-07 19:02:13,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:02:13,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1832 transitions. [2019-12-07 19:02:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 19:02:13,056 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:13,056 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:13,056 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:13,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:13,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1802100129, now seen corresponding path program 1 times [2019-12-07 19:02:13,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:13,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023835162] [2019-12-07 19:02:13,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 19:02:13,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023835162] [2019-12-07 19:02:13,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:13,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:02:13,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312204175] [2019-12-07 19:02:13,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:02:13,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:13,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:02:13,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:13,176 INFO L87 Difference]: Start difference. First operand 1265 states and 1832 transitions. Second operand 3 states. [2019-12-07 19:02:13,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:13,857 INFO L93 Difference]: Finished difference Result 3763 states and 5463 transitions. [2019-12-07 19:02:13,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:02:13,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-12-07 19:02:13,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:13,870 INFO L225 Difference]: With dead ends: 3763 [2019-12-07 19:02:13,871 INFO L226 Difference]: Without dead ends: 2500 [2019-12-07 19:02:13,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:13,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2019-12-07 19:02:13,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2486. [2019-12-07 19:02:13,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2486 states. [2019-12-07 19:02:13,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3511 transitions. [2019-12-07 19:02:13,950 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3511 transitions. Word has length 172 [2019-12-07 19:02:13,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:13,950 INFO L462 AbstractCegarLoop]: Abstraction has 2486 states and 3511 transitions. [2019-12-07 19:02:13,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:02:13,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3511 transitions. [2019-12-07 19:02:13,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-12-07 19:02:13,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:13,954 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:13,954 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:13,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:13,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1011238727, now seen corresponding path program 1 times [2019-12-07 19:02:13,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:13,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624259167] [2019-12-07 19:02:13,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 19:02:14,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624259167] [2019-12-07 19:02:14,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:14,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:02:14,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352794900] [2019-12-07 19:02:14,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:02:14,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:14,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:02:14,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:14,004 INFO L87 Difference]: Start difference. First operand 2486 states and 3511 transitions. Second operand 3 states. [2019-12-07 19:02:14,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:14,378 INFO L93 Difference]: Finished difference Result 4947 states and 6989 transitions. [2019-12-07 19:02:14,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:02:14,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-12-07 19:02:14,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:14,388 INFO L225 Difference]: With dead ends: 4947 [2019-12-07 19:02:14,388 INFO L226 Difference]: Without dead ends: 2463 [2019-12-07 19:02:14,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2019-12-07 19:02:14,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2463. [2019-12-07 19:02:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-12-07 19:02:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 3404 transitions. [2019-12-07 19:02:14,428 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 3404 transitions. Word has length 185 [2019-12-07 19:02:14,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:14,429 INFO L462 AbstractCegarLoop]: Abstraction has 2463 states and 3404 transitions. [2019-12-07 19:02:14,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:02:14,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 3404 transitions. [2019-12-07 19:02:14,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-12-07 19:02:14,432 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:14,433 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:14,433 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:14,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:14,433 INFO L82 PathProgramCache]: Analyzing trace with hash -794235702, now seen corresponding path program 1 times [2019-12-07 19:02:14,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:14,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869295031] [2019-12-07 19:02:14,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:14,495 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 19:02:14,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869295031] [2019-12-07 19:02:14,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:14,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:02:14,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42938502] [2019-12-07 19:02:14,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:02:14,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:14,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:02:14,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:14,497 INFO L87 Difference]: Start difference. First operand 2463 states and 3404 transitions. Second operand 3 states. [2019-12-07 19:02:15,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:15,101 INFO L93 Difference]: Finished difference Result 6960 states and 9633 transitions. [2019-12-07 19:02:15,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:02:15,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-12-07 19:02:15,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:15,121 INFO L225 Difference]: With dead ends: 6960 [2019-12-07 19:02:15,121 INFO L226 Difference]: Without dead ends: 4499 [2019-12-07 19:02:15,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:15,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4499 states. [2019-12-07 19:02:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4499 to 4496. [2019-12-07 19:02:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4496 states. [2019-12-07 19:02:15,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4496 states to 4496 states and 5968 transitions. [2019-12-07 19:02:15,206 INFO L78 Accepts]: Start accepts. Automaton has 4496 states and 5968 transitions. Word has length 206 [2019-12-07 19:02:15,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:15,207 INFO L462 AbstractCegarLoop]: Abstraction has 4496 states and 5968 transitions. [2019-12-07 19:02:15,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:02:15,207 INFO L276 IsEmpty]: Start isEmpty. Operand 4496 states and 5968 transitions. [2019-12-07 19:02:15,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-12-07 19:02:15,213 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:15,214 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:15,214 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:15,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:15,214 INFO L82 PathProgramCache]: Analyzing trace with hash -670047859, now seen corresponding path program 1 times [2019-12-07 19:02:15,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:15,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799638787] [2019-12-07 19:02:15,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:02:15,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799638787] [2019-12-07 19:02:15,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:15,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:02:15,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816071227] [2019-12-07 19:02:15,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:02:15,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:15,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:02:15,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:02:15,324 INFO L87 Difference]: Start difference. First operand 4496 states and 5968 transitions. Second operand 4 states. [2019-12-07 19:02:16,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:16,389 INFO L93 Difference]: Finished difference Result 15700 states and 20741 transitions. [2019-12-07 19:02:16,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:02:16,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-12-07 19:02:16,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:16,425 INFO L225 Difference]: With dead ends: 15700 [2019-12-07 19:02:16,425 INFO L226 Difference]: Without dead ends: 11206 [2019-12-07 19:02:16,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:02:16,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11206 states. [2019-12-07 19:02:16,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11206 to 8354. [2019-12-07 19:02:16,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8354 states. [2019-12-07 19:02:16,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8354 states to 8354 states and 10662 transitions. [2019-12-07 19:02:16,533 INFO L78 Accepts]: Start accepts. Automaton has 8354 states and 10662 transitions. Word has length 211 [2019-12-07 19:02:16,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:16,533 INFO L462 AbstractCegarLoop]: Abstraction has 8354 states and 10662 transitions. [2019-12-07 19:02:16,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:02:16,533 INFO L276 IsEmpty]: Start isEmpty. Operand 8354 states and 10662 transitions. [2019-12-07 19:02:16,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-12-07 19:02:16,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:16,544 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:16,544 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:16,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:16,544 INFO L82 PathProgramCache]: Analyzing trace with hash 314070830, now seen corresponding path program 1 times [2019-12-07 19:02:16,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:16,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89102735] [2019-12-07 19:02:16,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:16,605 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 19:02:16,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89102735] [2019-12-07 19:02:16,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:16,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:02:16,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007617363] [2019-12-07 19:02:16,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:02:16,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:16,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:02:16,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:16,606 INFO L87 Difference]: Start difference. First operand 8354 states and 10662 transitions. Second operand 3 states. [2019-12-07 19:02:17,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:17,225 INFO L93 Difference]: Finished difference Result 20785 states and 26523 transitions. [2019-12-07 19:02:17,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:02:17,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-12-07 19:02:17,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:17,253 INFO L225 Difference]: With dead ends: 20785 [2019-12-07 19:02:17,253 INFO L226 Difference]: Without dead ends: 12433 [2019-12-07 19:02:17,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:17,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12433 states. [2019-12-07 19:02:17,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12433 to 12430. [2019-12-07 19:02:17,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12430 states. [2019-12-07 19:02:17,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12430 states to 12430 states and 15815 transitions. [2019-12-07 19:02:17,370 INFO L78 Accepts]: Start accepts. Automaton has 12430 states and 15815 transitions. Word has length 219 [2019-12-07 19:02:17,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:17,370 INFO L462 AbstractCegarLoop]: Abstraction has 12430 states and 15815 transitions. [2019-12-07 19:02:17,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:02:17,370 INFO L276 IsEmpty]: Start isEmpty. Operand 12430 states and 15815 transitions. [2019-12-07 19:02:17,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-12-07 19:02:17,382 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:17,382 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:17,382 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:17,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:17,382 INFO L82 PathProgramCache]: Analyzing trace with hash 660276643, now seen corresponding path program 1 times [2019-12-07 19:02:17,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:17,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177619221] [2019-12-07 19:02:17,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:17,462 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 19:02:17,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177619221] [2019-12-07 19:02:17,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785582364] [2019-12-07 19:02:17,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6bcc7ace-0aec-4237-9562-2e8a4749da9e/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:02:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:17,567 INFO L264 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 19:02:17,577 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:02:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-12-07 19:02:17,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:02:17,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-12-07 19:02:17,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833104376] [2019-12-07 19:02:17,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:02:17,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:17,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:02:17,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:02:17,644 INFO L87 Difference]: Start difference. First operand 12430 states and 15815 transitions. Second operand 3 states. [2019-12-07 19:02:18,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:18,545 INFO L93 Difference]: Finished difference Result 34823 states and 44450 transitions. [2019-12-07 19:02:18,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:02:18,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-12-07 19:02:18,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:18,569 INFO L225 Difference]: With dead ends: 34823 [2019-12-07 19:02:18,569 INFO L226 Difference]: Without dead ends: 22395 [2019-12-07 19:02:18,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:02:18,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22395 states. [2019-12-07 19:02:18,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22395 to 20769. [2019-12-07 19:02:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20769 states. [2019-12-07 19:02:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20769 states to 20769 states and 25871 transitions. [2019-12-07 19:02:18,790 INFO L78 Accepts]: Start accepts. Automaton has 20769 states and 25871 transitions. Word has length 226 [2019-12-07 19:02:18,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:18,790 INFO L462 AbstractCegarLoop]: Abstraction has 20769 states and 25871 transitions. [2019-12-07 19:02:18,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:02:18,791 INFO L276 IsEmpty]: Start isEmpty. Operand 20769 states and 25871 transitions. [2019-12-07 19:02:18,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-12-07 19:02:18,824 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:18,825 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:19,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:02:19,025 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:19,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:19,026 INFO L82 PathProgramCache]: Analyzing trace with hash 222902275, now seen corresponding path program 1 times [2019-12-07 19:02:19,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:19,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054244015] [2019-12-07 19:02:19,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 19:02:19,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054244015] [2019-12-07 19:02:19,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:19,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:02:19,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984734148] [2019-12-07 19:02:19,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:02:19,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:19,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:02:19,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:02:19,147 INFO L87 Difference]: Start difference. First operand 20769 states and 25871 transitions. Second operand 5 states. [2019-12-07 19:02:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:20,428 INFO L93 Difference]: Finished difference Result 62076 states and 77235 transitions. [2019-12-07 19:02:20,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:02:20,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 226 [2019-12-07 19:02:20,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:20,496 INFO L225 Difference]: With dead ends: 62076 [2019-12-07 19:02:20,496 INFO L226 Difference]: Without dead ends: 41309 [2019-12-07 19:02:20,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:02:20,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41309 states. [2019-12-07 19:02:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41309 to 41301. [2019-12-07 19:02:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41301 states. [2019-12-07 19:02:20,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41301 states to 41301 states and 49699 transitions. [2019-12-07 19:02:20,824 INFO L78 Accepts]: Start accepts. Automaton has 41301 states and 49699 transitions. Word has length 226 [2019-12-07 19:02:20,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:20,824 INFO L462 AbstractCegarLoop]: Abstraction has 41301 states and 49699 transitions. [2019-12-07 19:02:20,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:02:20,824 INFO L276 IsEmpty]: Start isEmpty. Operand 41301 states and 49699 transitions. [2019-12-07 19:02:20,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-12-07 19:02:20,854 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:20,854 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 19:02:20,854 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:20,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:20,855 INFO L82 PathProgramCache]: Analyzing trace with hash -473613121, now seen corresponding path program 1 times [2019-12-07 19:02:20,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:20,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147420729] [2019-12-07 19:02:20,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:02:20,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147420729] [2019-12-07 19:02:20,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:20,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:02:20,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306647843] [2019-12-07 19:02:20,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:02:20,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:20,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:02:20,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:20,993 INFO L87 Difference]: Start difference. First operand 41301 states and 49699 transitions. Second operand 3 states. [2019-12-07 19:02:21,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:21,778 INFO L93 Difference]: Finished difference Result 105212 states and 126813 transitions. [2019-12-07 19:02:21,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:02:21,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2019-12-07 19:02:21,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:21,842 INFO L225 Difference]: With dead ends: 105212 [2019-12-07 19:02:21,842 INFO L226 Difference]: Without dead ends: 63913 [2019-12-07 19:02:21,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:21,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63913 states. [2019-12-07 19:02:22,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63913 to 63909. [2019-12-07 19:02:22,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63909 states. [2019-12-07 19:02:22,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63909 states to 63909 states and 76912 transitions. [2019-12-07 19:02:22,502 INFO L78 Accepts]: Start accepts. Automaton has 63909 states and 76912 transitions. Word has length 272 [2019-12-07 19:02:22,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:22,502 INFO L462 AbstractCegarLoop]: Abstraction has 63909 states and 76912 transitions. [2019-12-07 19:02:22,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:02:22,503 INFO L276 IsEmpty]: Start isEmpty. Operand 63909 states and 76912 transitions. [2019-12-07 19:02:22,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-12-07 19:02:22,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:22,533 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:22,533 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:22,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:22,533 INFO L82 PathProgramCache]: Analyzing trace with hash 251932010, now seen corresponding path program 1 times [2019-12-07 19:02:22,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:22,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865623290] [2019-12-07 19:02:22,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:02:23,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865623290] [2019-12-07 19:02:23,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:23,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 19:02:23,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079050626] [2019-12-07 19:02:23,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:02:23,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:23,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:02:23,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:02:23,426 INFO L87 Difference]: Start difference. First operand 63909 states and 76912 transitions. Second operand 11 states. [2019-12-07 19:02:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:26,425 INFO L93 Difference]: Finished difference Result 174840 states and 208641 transitions. [2019-12-07 19:02:26,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:02:26,426 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 279 [2019-12-07 19:02:26,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:26,536 INFO L225 Difference]: With dead ends: 174840 [2019-12-07 19:02:26,536 INFO L226 Difference]: Without dead ends: 110933 [2019-12-07 19:02:26,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:02:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110933 states. [2019-12-07 19:02:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110933 to 108646. [2019-12-07 19:02:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108646 states. [2019-12-07 19:02:27,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108646 states to 108646 states and 129141 transitions. [2019-12-07 19:02:27,700 INFO L78 Accepts]: Start accepts. Automaton has 108646 states and 129141 transitions. Word has length 279 [2019-12-07 19:02:27,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:27,701 INFO L462 AbstractCegarLoop]: Abstraction has 108646 states and 129141 transitions. [2019-12-07 19:02:27,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:02:27,701 INFO L276 IsEmpty]: Start isEmpty. Operand 108646 states and 129141 transitions. [2019-12-07 19:02:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-12-07 19:02:27,752 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:27,752 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:27,752 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:27,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:27,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1251867700, now seen corresponding path program 1 times [2019-12-07 19:02:27,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:27,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816595362] [2019-12-07 19:02:27,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:27,897 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 19:02:27,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816595362] [2019-12-07 19:02:27,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:27,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:02:27,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080892613] [2019-12-07 19:02:27,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:02:27,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:27,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:02:27,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:02:27,898 INFO L87 Difference]: Start difference. First operand 108646 states and 129141 transitions. Second operand 5 states. [2019-12-07 19:02:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:30,920 INFO L93 Difference]: Finished difference Result 333508 states and 394881 transitions. [2019-12-07 19:02:30,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:02:30,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2019-12-07 19:02:30,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:31,159 INFO L225 Difference]: With dead ends: 333508 [2019-12-07 19:02:31,160 INFO L226 Difference]: Without dead ends: 224864 [2019-12-07 19:02:31,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:02:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224864 states. [2019-12-07 19:02:33,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224864 to 217936. [2019-12-07 19:02:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217936 states. [2019-12-07 19:02:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217936 states to 217936 states and 253733 transitions. [2019-12-07 19:02:33,640 INFO L78 Accepts]: Start accepts. Automaton has 217936 states and 253733 transitions. Word has length 279 [2019-12-07 19:02:33,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:33,641 INFO L462 AbstractCegarLoop]: Abstraction has 217936 states and 253733 transitions. [2019-12-07 19:02:33,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:02:33,641 INFO L276 IsEmpty]: Start isEmpty. Operand 217936 states and 253733 transitions. [2019-12-07 19:02:35,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-12-07 19:02:35,012 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:35,012 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 19:02:35,012 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:35,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:35,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1190198936, now seen corresponding path program 1 times [2019-12-07 19:02:35,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:35,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346740401] [2019-12-07 19:02:35,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-12-07 19:02:35,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346740401] [2019-12-07 19:02:35,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:35,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:02:35,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576982723] [2019-12-07 19:02:35,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:02:35,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:35,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:02:35,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:02:35,134 INFO L87 Difference]: Start difference. First operand 217936 states and 253733 transitions. Second operand 4 states. [2019-12-07 19:02:36,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:36,741 INFO L93 Difference]: Finished difference Result 435984 states and 507676 transitions. [2019-12-07 19:02:36,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:02:36,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2019-12-07 19:02:36,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:36,968 INFO L225 Difference]: With dead ends: 435984 [2019-12-07 19:02:36,968 INFO L226 Difference]: Without dead ends: 218050 [2019-12-07 19:02:37,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:02:37,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218050 states. [2019-12-07 19:02:39,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218050 to 217936. [2019-12-07 19:02:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217936 states. [2019-12-07 19:02:39,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217936 states to 217936 states and 252928 transitions. [2019-12-07 19:02:39,353 INFO L78 Accepts]: Start accepts. Automaton has 217936 states and 252928 transitions. Word has length 286 [2019-12-07 19:02:39,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:39,353 INFO L462 AbstractCegarLoop]: Abstraction has 217936 states and 252928 transitions. [2019-12-07 19:02:39,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:02:39,354 INFO L276 IsEmpty]: Start isEmpty. Operand 217936 states and 252928 transitions. [2019-12-07 19:02:39,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-12-07 19:02:39,427 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:39,428 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 19:02:39,428 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:39,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:39,428 INFO L82 PathProgramCache]: Analyzing trace with hash 582457027, now seen corresponding path program 1 times [2019-12-07 19:02:39,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:39,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634997246] [2019-12-07 19:02:39,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-12-07 19:02:39,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634997246] [2019-12-07 19:02:39,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:39,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:02:39,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810267692] [2019-12-07 19:02:39,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:02:39,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:39,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:02:39,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:39,526 INFO L87 Difference]: Start difference. First operand 217936 states and 252928 transitions. Second operand 3 states. [2019-12-07 19:02:41,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:41,118 INFO L93 Difference]: Finished difference Result 408214 states and 473629 transitions. [2019-12-07 19:02:41,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:02:41,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2019-12-07 19:02:41,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:41,303 INFO L225 Difference]: With dead ends: 408214 [2019-12-07 19:02:41,304 INFO L226 Difference]: Without dead ends: 190280 [2019-12-07 19:02:41,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:41,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190280 states. [2019-12-07 19:02:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190280 to 190258. [2019-12-07 19:02:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190258 states. [2019-12-07 19:02:43,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190258 states to 190258 states and 215527 transitions. [2019-12-07 19:02:43,297 INFO L78 Accepts]: Start accepts. Automaton has 190258 states and 215527 transitions. Word has length 299 [2019-12-07 19:02:43,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:43,297 INFO L462 AbstractCegarLoop]: Abstraction has 190258 states and 215527 transitions. [2019-12-07 19:02:43,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:02:43,297 INFO L276 IsEmpty]: Start isEmpty. Operand 190258 states and 215527 transitions. [2019-12-07 19:02:43,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-12-07 19:02:43,359 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:43,359 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 19:02:43,360 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:43,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:43,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1180504, now seen corresponding path program 1 times [2019-12-07 19:02:43,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:43,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974416112] [2019-12-07 19:02:43,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:02:43,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974416112] [2019-12-07 19:02:43,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:43,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:02:43,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554780631] [2019-12-07 19:02:43,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:02:43,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:43,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:02:43,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:02:43,545 INFO L87 Difference]: Start difference. First operand 190258 states and 215527 transitions. Second operand 4 states. [2019-12-07 19:02:45,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:45,339 INFO L93 Difference]: Finished difference Result 395154 states and 446931 transitions. [2019-12-07 19:02:45,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:02:45,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 307 [2019-12-07 19:02:45,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:45,564 INFO L225 Difference]: With dead ends: 395154 [2019-12-07 19:02:45,565 INFO L226 Difference]: Without dead ends: 204894 [2019-12-07 19:02:45,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:02:45,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204894 states. [2019-12-07 19:02:47,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204894 to 194115. [2019-12-07 19:02:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194115 states. [2019-12-07 19:02:47,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194115 states to 194115 states and 219495 transitions. [2019-12-07 19:02:47,911 INFO L78 Accepts]: Start accepts. Automaton has 194115 states and 219495 transitions. Word has length 307 [2019-12-07 19:02:47,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:47,911 INFO L462 AbstractCegarLoop]: Abstraction has 194115 states and 219495 transitions. [2019-12-07 19:02:47,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:02:47,911 INFO L276 IsEmpty]: Start isEmpty. Operand 194115 states and 219495 transitions. [2019-12-07 19:02:48,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-12-07 19:02:48,001 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:48,001 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 19:02:48,001 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:48,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:48,002 INFO L82 PathProgramCache]: Analyzing trace with hash -2054214025, now seen corresponding path program 1 times [2019-12-07 19:02:48,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:48,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872086900] [2019-12-07 19:02:48,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:48,152 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-12-07 19:02:48,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872086900] [2019-12-07 19:02:48,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:48,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:02:48,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029527463] [2019-12-07 19:02:48,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:02:48,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:48,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:02:48,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:02:48,153 INFO L87 Difference]: Start difference. First operand 194115 states and 219495 transitions. Second operand 4 states. [2019-12-07 19:02:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:49,907 INFO L93 Difference]: Finished difference Result 503954 states and 570101 transitions. [2019-12-07 19:02:49,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:02:49,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 341 [2019-12-07 19:02:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:50,209 INFO L225 Difference]: With dead ends: 503954 [2019-12-07 19:02:50,209 INFO L226 Difference]: Without dead ends: 309841 [2019-12-07 19:02:50,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:02:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309841 states. [2019-12-07 19:02:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309841 to 309839. [2019-12-07 19:02:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309839 states. [2019-12-07 19:02:53,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309839 states to 309839 states and 350431 transitions. [2019-12-07 19:02:53,588 INFO L78 Accepts]: Start accepts. Automaton has 309839 states and 350431 transitions. Word has length 341 [2019-12-07 19:02:53,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:53,588 INFO L462 AbstractCegarLoop]: Abstraction has 309839 states and 350431 transitions. [2019-12-07 19:02:53,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:02:53,588 INFO L276 IsEmpty]: Start isEmpty. Operand 309839 states and 350431 transitions. [2019-12-07 19:02:53,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-12-07 19:02:53,657 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:53,657 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 19:02:53,657 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:53,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:53,658 INFO L82 PathProgramCache]: Analyzing trace with hash -906816526, now seen corresponding path program 1 times [2019-12-07 19:02:53,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:53,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550990785] [2019-12-07 19:02:53,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 19:02:53,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550990785] [2019-12-07 19:02:53,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:53,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:02:53,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277892600] [2019-12-07 19:02:53,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:02:53,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:53,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:02:53,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:02:53,784 INFO L87 Difference]: Start difference. First operand 309839 states and 350431 transitions. Second operand 4 states. [2019-12-07 19:02:56,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:56,107 INFO L93 Difference]: Finished difference Result 640882 states and 725522 transitions. [2019-12-07 19:02:56,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:02:56,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 341 [2019-12-07 19:02:56,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:58,509 INFO L225 Difference]: With dead ends: 640882 [2019-12-07 19:02:58,510 INFO L226 Difference]: Without dead ends: 331045 [2019-12-07 19:02:58,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:02:58,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331045 states. [2019-12-07 19:03:01,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331045 to 322668. [2019-12-07 19:03:01,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322668 states. [2019-12-07 19:03:01,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322668 states to 322668 states and 364337 transitions. [2019-12-07 19:03:01,981 INFO L78 Accepts]: Start accepts. Automaton has 322668 states and 364337 transitions. Word has length 341 [2019-12-07 19:03:01,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:03:01,981 INFO L462 AbstractCegarLoop]: Abstraction has 322668 states and 364337 transitions. [2019-12-07 19:03:01,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:03:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 322668 states and 364337 transitions. [2019-12-07 19:03:02,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-12-07 19:03:02,046 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:03:02,047 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 19:03:02,047 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:03:02,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:03:02,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1458011017, now seen corresponding path program 1 times [2019-12-07 19:03:02,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:03:02,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012943843] [2019-12-07 19:03:02,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:03:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:03:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-12-07 19:03:02,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012943843] [2019-12-07 19:03:02,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:03:02,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:03:02,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289358113] [2019-12-07 19:03:02,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:03:02,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:03:02,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:03:02,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:03:02,150 INFO L87 Difference]: Start difference. First operand 322668 states and 364337 transitions. Second operand 4 states. [2019-12-07 19:03:04,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:03:04,166 INFO L93 Difference]: Finished difference Result 621756 states and 700892 transitions. [2019-12-07 19:03:04,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:03:04,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 343 [2019-12-07 19:03:04,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:03:04,502 INFO L225 Difference]: With dead ends: 621756 [2019-12-07 19:03:04,502 INFO L226 Difference]: Without dead ends: 299090 [2019-12-07 19:03:04,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:03:04,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299090 states. [2019-12-07 19:03:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299090 to 256663. [2019-12-07 19:03:07,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256663 states. [2019-12-07 19:03:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256663 states to 256663 states and 283227 transitions. [2019-12-07 19:03:07,593 INFO L78 Accepts]: Start accepts. Automaton has 256663 states and 283227 transitions. Word has length 343 [2019-12-07 19:03:07,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:03:07,593 INFO L462 AbstractCegarLoop]: Abstraction has 256663 states and 283227 transitions. [2019-12-07 19:03:07,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:03:07,593 INFO L276 IsEmpty]: Start isEmpty. Operand 256663 states and 283227 transitions. [2019-12-07 19:03:07,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-12-07 19:03:07,655 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:03:07,655 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:03:07,655 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:03:07,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:03:07,656 INFO L82 PathProgramCache]: Analyzing trace with hash 20936071, now seen corresponding path program 1 times [2019-12-07 19:03:07,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:03:07,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636565123] [2019-12-07 19:03:07,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:03:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:03:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 448 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-12-07 19:03:07,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636565123] [2019-12-07 19:03:07,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:03:07,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:03:07,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859093880] [2019-12-07 19:03:07,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:03:07,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:03:07,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:03:07,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:03:07,841 INFO L87 Difference]: Start difference. First operand 256663 states and 283227 transitions. Second operand 3 states. [2019-12-07 19:03:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:03:09,485 INFO L93 Difference]: Finished difference Result 683115 states and 753640 transitions. [2019-12-07 19:03:09,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:03:09,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 444 [2019-12-07 19:03:09,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:03:09,950 INFO L225 Difference]: With dead ends: 683115 [2019-12-07 19:03:09,950 INFO L226 Difference]: Without dead ends: 426657 [2019-12-07 19:03:10,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:03:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426657 states. [2019-12-07 19:03:16,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426657 to 413659. [2019-12-07 19:03:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413659 states. [2019-12-07 19:03:16,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413659 states to 413659 states and 453414 transitions. [2019-12-07 19:03:16,833 INFO L78 Accepts]: Start accepts. Automaton has 413659 states and 453414 transitions. Word has length 444 [2019-12-07 19:03:16,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:03:16,834 INFO L462 AbstractCegarLoop]: Abstraction has 413659 states and 453414 transitions. [2019-12-07 19:03:16,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:03:16,834 INFO L276 IsEmpty]: Start isEmpty. Operand 413659 states and 453414 transitions. [2019-12-07 19:03:16,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-12-07 19:03:16,933 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:03:16,933 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:03:16,934 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:03:16,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:03:16,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1119627475, now seen corresponding path program 1 times [2019-12-07 19:03:16,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:03:16,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624192070] [2019-12-07 19:03:16,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:03:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:03:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 374 proven. 81 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-12-07 19:03:17,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624192070] [2019-12-07 19:03:17,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493046744] [2019-12-07 19:03:17,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6bcc7ace-0aec-4237-9562-2e8a4749da9e/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:03:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:03:17,813 INFO L264 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 19:03:17,822 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:03:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-12-07 19:03:17,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:03:17,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-12-07 19:03:17,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361613076] [2019-12-07 19:03:17,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:03:17,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:03:17,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:03:17,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:03:17,917 INFO L87 Difference]: Start difference. First operand 413659 states and 453414 transitions. Second operand 3 states. [2019-12-07 19:03:20,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:03:20,825 INFO L93 Difference]: Finished difference Result 1115452 states and 1223294 transitions. [2019-12-07 19:03:20,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:03:20,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 446 [2019-12-07 19:03:20,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:03:21,585 INFO L225 Difference]: With dead ends: 1115452 [2019-12-07 19:03:21,585 INFO L226 Difference]: Without dead ends: 684743 [2019-12-07 19:03:21,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:03:22,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684743 states. [2019-12-07 19:03:28,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684743 to 622372. [2019-12-07 19:03:28,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622372 states. [2019-12-07 19:03:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622372 states to 622372 states and 674342 transitions. [2019-12-07 19:03:28,777 INFO L78 Accepts]: Start accepts. Automaton has 622372 states and 674342 transitions. Word has length 446 [2019-12-07 19:03:28,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:03:28,777 INFO L462 AbstractCegarLoop]: Abstraction has 622372 states and 674342 transitions. [2019-12-07 19:03:28,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:03:28,777 INFO L276 IsEmpty]: Start isEmpty. Operand 622372 states and 674342 transitions. [2019-12-07 19:03:28,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-12-07 19:03:28,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:03:28,909 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:03:29,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:03:29,110 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:03:29,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:03:29,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1755699700, now seen corresponding path program 1 times [2019-12-07 19:03:29,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:03:29,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065728873] [2019-12-07 19:03:29,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:03:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:03:29,351 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 467 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-12-07 19:03:29,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065728873] [2019-12-07 19:03:29,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:03:29,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:03:29,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682715148] [2019-12-07 19:03:29,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:03:29,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:03:29,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:03:29,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:03:29,352 INFO L87 Difference]: Start difference. First operand 622372 states and 674342 transitions. Second operand 4 states. [2019-12-07 19:03:34,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:03:34,743 INFO L93 Difference]: Finished difference Result 1216650 states and 1318318 transitions. [2019-12-07 19:03:34,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:03:34,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 477 [2019-12-07 19:03:34,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:03:34,744 INFO L225 Difference]: With dead ends: 1216650 [2019-12-07 19:03:34,744 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 19:03:35,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:03:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 19:03:35,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 19:03:35,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 19:03:35,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 19:03:35,081 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 477 [2019-12-07 19:03:35,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:03:35,081 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 19:03:35,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:03:35,081 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 19:03:35,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 19:03:35,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 19:05:21,869 WARN L192 SmtUtils]: Spent 1.78 m on a formula simplification. DAG size of input: 4822 DAG size of output: 2334 [2019-12-07 19:07:09,173 WARN L192 SmtUtils]: Spent 1.79 m on a formula simplification. DAG size of input: 4822 DAG size of output: 2334 [2019-12-07 19:08:14,061 WARN L192 SmtUtils]: Spent 1.08 m on a formula simplification. DAG size of input: 2129 DAG size of output: 156 [2019-12-07 19:09:22,504 WARN L192 SmtUtils]: Spent 1.14 m on a formula simplification. DAG size of input: 2129 DAG size of output: 156 [2019-12-07 19:09:22,509 INFO L246 CegarLoopResult]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-12-07 19:09:22,510 INFO L246 CegarLoopResult]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-12-07 19:09:22,510 INFO L246 CegarLoopResult]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,510 INFO L246 CegarLoopResult]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,510 INFO L246 CegarLoopResult]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,510 INFO L246 CegarLoopResult]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,510 INFO L246 CegarLoopResult]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,510 INFO L246 CegarLoopResult]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,510 INFO L246 CegarLoopResult]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,510 INFO L246 CegarLoopResult]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-12-07 19:09:22,511 INFO L246 CegarLoopResult]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,511 INFO L246 CegarLoopResult]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-12-07 19:09:22,511 INFO L246 CegarLoopResult]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-12-07 19:09:22,511 INFO L246 CegarLoopResult]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,511 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,511 INFO L246 CegarLoopResult]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,511 INFO L246 CegarLoopResult]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,511 INFO L246 CegarLoopResult]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-12-07 19:09:22,511 INFO L246 CegarLoopResult]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-12-07 19:09:22,511 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,512 INFO L246 CegarLoopResult]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,512 INFO L246 CegarLoopResult]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,512 INFO L246 CegarLoopResult]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,512 INFO L246 CegarLoopResult]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,512 INFO L246 CegarLoopResult]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,512 INFO L246 CegarLoopResult]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,512 INFO L246 CegarLoopResult]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,512 INFO L246 CegarLoopResult]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,512 INFO L246 CegarLoopResult]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,513 INFO L246 CegarLoopResult]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-12-07 19:09:22,513 INFO L246 CegarLoopResult]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-12-07 19:09:22,513 INFO L246 CegarLoopResult]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-12-07 19:09:22,513 INFO L246 CegarLoopResult]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,513 INFO L246 CegarLoopResult]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,513 INFO L246 CegarLoopResult]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,513 INFO L246 CegarLoopResult]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,513 INFO L246 CegarLoopResult]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,513 INFO L246 CegarLoopResult]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,513 INFO L246 CegarLoopResult]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-12-07 19:09:22,514 INFO L246 CegarLoopResult]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-12-07 19:09:22,514 INFO L246 CegarLoopResult]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-12-07 19:09:22,514 INFO L246 CegarLoopResult]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,514 INFO L246 CegarLoopResult]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,514 INFO L246 CegarLoopResult]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,514 INFO L246 CegarLoopResult]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,514 INFO L246 CegarLoopResult]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,514 INFO L246 CegarLoopResult]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,514 INFO L246 CegarLoopResult]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-12-07 19:09:22,514 INFO L246 CegarLoopResult]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-12-07 19:09:22,515 INFO L246 CegarLoopResult]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-12-07 19:09:22,515 INFO L246 CegarLoopResult]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,515 INFO L246 CegarLoopResult]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,515 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,515 INFO L246 CegarLoopResult]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-12-07 19:09:22,515 INFO L246 CegarLoopResult]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,515 INFO L246 CegarLoopResult]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-12-07 19:09:22,515 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,515 INFO L246 CegarLoopResult]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,516 INFO L246 CegarLoopResult]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-12-07 19:09:22,516 INFO L246 CegarLoopResult]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-12-07 19:09:22,516 INFO L246 CegarLoopResult]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,516 INFO L246 CegarLoopResult]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,516 INFO L246 CegarLoopResult]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,516 INFO L246 CegarLoopResult]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,516 INFO L246 CegarLoopResult]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,516 INFO L246 CegarLoopResult]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,516 INFO L246 CegarLoopResult]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,517 INFO L246 CegarLoopResult]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-12-07 19:09:22,517 INFO L246 CegarLoopResult]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-12-07 19:09:22,517 INFO L246 CegarLoopResult]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-12-07 19:09:22,517 INFO L246 CegarLoopResult]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-12-07 19:09:22,517 INFO L246 CegarLoopResult]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-12-07 19:09:22,517 INFO L246 CegarLoopResult]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,517 INFO L246 CegarLoopResult]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,517 INFO L246 CegarLoopResult]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,517 INFO L246 CegarLoopResult]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,517 INFO L246 CegarLoopResult]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,518 INFO L246 CegarLoopResult]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,518 INFO L246 CegarLoopResult]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,518 INFO L246 CegarLoopResult]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,518 INFO L246 CegarLoopResult]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,518 INFO L246 CegarLoopResult]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,518 INFO L246 CegarLoopResult]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-12-07 19:09:22,518 INFO L246 CegarLoopResult]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-12-07 19:09:22,518 INFO L246 CegarLoopResult]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-12-07 19:09:22,518 INFO L246 CegarLoopResult]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,519 INFO L246 CegarLoopResult]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,519 INFO L246 CegarLoopResult]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,519 INFO L246 CegarLoopResult]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,519 INFO L246 CegarLoopResult]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,519 INFO L246 CegarLoopResult]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,519 INFO L246 CegarLoopResult]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,519 INFO L246 CegarLoopResult]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,519 INFO L246 CegarLoopResult]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,519 INFO L246 CegarLoopResult]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-12-07 19:09:22,519 INFO L246 CegarLoopResult]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-12-07 19:09:22,520 INFO L246 CegarLoopResult]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-12-07 19:09:22,520 INFO L246 CegarLoopResult]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-12-07 19:09:22,520 INFO L246 CegarLoopResult]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-12-07 19:09:22,520 INFO L246 CegarLoopResult]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,520 INFO L246 CegarLoopResult]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,520 INFO L246 CegarLoopResult]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,520 INFO L246 CegarLoopResult]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,520 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,520 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 19:09:22,521 INFO L246 CegarLoopResult]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,521 INFO L246 CegarLoopResult]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,521 INFO L246 CegarLoopResult]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,521 INFO L246 CegarLoopResult]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-12-07 19:09:22,521 INFO L246 CegarLoopResult]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-12-07 19:09:22,521 INFO L246 CegarLoopResult]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-12-07 19:09:22,521 INFO L246 CegarLoopResult]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,521 INFO L246 CegarLoopResult]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,521 INFO L246 CegarLoopResult]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,521 INFO L246 CegarLoopResult]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-12-07 19:09:22,522 INFO L246 CegarLoopResult]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-12-07 19:09:22,522 INFO L246 CegarLoopResult]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,522 INFO L246 CegarLoopResult]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,522 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,522 INFO L246 CegarLoopResult]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-12-07 19:09:22,522 INFO L246 CegarLoopResult]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,522 INFO L246 CegarLoopResult]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-12-07 19:09:22,522 INFO L246 CegarLoopResult]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,522 INFO L246 CegarLoopResult]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-12-07 19:09:22,522 INFO L246 CegarLoopResult]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,522 INFO L246 CegarLoopResult]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,523 INFO L246 CegarLoopResult]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-12-07 19:09:22,523 INFO L246 CegarLoopResult]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-12-07 19:09:22,523 INFO L246 CegarLoopResult]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-12-07 19:09:22,523 INFO L246 CegarLoopResult]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-12-07 19:09:22,523 INFO L246 CegarLoopResult]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-12-07 19:09:22,523 INFO L246 CegarLoopResult]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-12-07 19:09:22,523 INFO L246 CegarLoopResult]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-12-07 19:09:22,523 INFO L246 CegarLoopResult]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,523 INFO L246 CegarLoopResult]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,523 INFO L246 CegarLoopResult]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,526 INFO L242 CegarLoopResult]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse5 (= 0 ~a3~0)) (.cse2 (= 1 ~a6~0))) (let ((.cse21 (<= ~a23~0 0)) (.cse16 (<= ~a6~0 0)) (.cse20 (= ~a17~0 1)) (.cse11 (not .cse2)) (.cse15 (= ~a11~0 1)) (.cse13 (= ~a15~0 1)) (.cse3 (not (= 1 ~a7~0))) (.cse7 (= ~a29~0 1)) (.cse19 (<= ~a4~0 0)) (.cse18 (= 1 ~a3~0)) (.cse14 (not .cse5)) (.cse10 (<= ~a12~0 0)) (.cse6 (<= ~a26~0 0)) (.cse8 (= 1 ~a0~0)) (.cse0 (= ~a27~0 1)) (.cse1 (= 1 ~a5~0)) (.cse17 (= ~a12~0 1)) (.cse4 (<= ~a11~0 0)) (.cse12 (= ~a26~0 1)) (.cse9 (= ~a16~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse4 .cse11 .cse12 .cse13) (and .cse14 .cse10 .cse0 .cse1 .cse11 .cse15 .cse12 .cse8 .cse13) (and .cse10 .cse0 .cse1 .cse5 .cse11 .cse6 .cse7 .cse15) (and .cse14 .cse16 .cse0 .cse1 .cse17 .cse4 .cse6 .cse8) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse9) (and .cse10 .cse18 .cse1 .cse3 .cse4 .cse12 .cse8) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse19 .cse0 .cse1 .cse4 .cse20 .cse5 .cse11 .cse12 .cse8 .cse13) (and .cse0 .cse1 .cse17 .cse4 .cse12 .cse13) (and .cse0 .cse1 .cse17 .cse4 .cse7 .cse12 .cse8) (and .cse1 .cse17 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse15 .cse12 .cse9) (and .cse10 .cse0 .cse1 .cse4 .cse11 .cse6 .cse8 .cse13) (and .cse14 .cse0 .cse1 .cse17 .cse3 .cse4 .cse6 .cse7) (and .cse19 .cse10 .cse1 .cse2 .cse15 .cse12 .cse8) (and .cse19 .cse0 .cse1 .cse4 .cse20 .cse5 .cse7 .cse11 .cse12 .cse9 .cse13) (and .cse1 .cse17 .cse4 .cse11 .cse12) (and .cse19 .cse0 .cse18 .cse1 .cse2 .cse4 .cse7 .cse12) (and .cse10 .cse0 .cse1 .cse11 .cse6 .cse15 .cse8) (and .cse16 .cse10 .cse1 .cse5 .cse7 .cse15 .cse12 .cse8) (and .cse16 .cse1 .cse3 .cse5 .cse7 .cse15 .cse12 .cse8) (and .cse19 .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse15 .cse9) (and .cse19 .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9) (and .cse14 .cse10 .cse0 .cse1 .cse2 .cse4 .cse12 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse12 .cse8) (and .cse18 .cse1 .cse17 .cse4 .cse6 .cse11 .cse8) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse15 .cse9) (and .cse0 .cse1 .cse3 .cse15 .cse12 .cse9)) .cse10) (and .cse10 .cse16 .cse1 .cse5 .cse15 .cse12 .cse9 .cse8 .cse21) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse6 .cse8) (and .cse10 .cse0 .cse18 .cse1 .cse3 .cse6 .cse15 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse15 .cse9) (and .cse10 .cse0 .cse1 .cse11 .cse15 .cse12 .cse9) (and .cse0 .cse1 .cse2 .cse17 .cse5 .cse6 .cse15 .cse8 .cse13) (and .cse19 .cse10 .cse1 .cse2 .cse3 .cse4 .cse12) (and .cse14 .cse10 .cse1 .cse2 .cse3 .cse4 .cse7 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse12 .cse8 .cse13) (and .cse19 .cse0 .cse18 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse12 .cse9 .cse8) (and .cse1 .cse2 .cse5 .cse7 .cse15 .cse12 .cse8) (and .cse1 .cse17 .cse3 .cse4 .cse12) (and .cse10 .cse0 .cse1 .cse4 .cse11 .cse6 .cse7 .cse8) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse12 .cse8 .cse13) (and .cse10 .cse1 .cse18 .cse4 .cse6 .cse8) (and .cse0 .cse1 .cse2 .cse5 .cse7 .cse15 .cse12 .cse13) (and .cse14 .cse10 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse10 .cse0 .cse1 .cse4 .cse5 .cse11 .cse6 .cse7 .cse9) (and .cse19 .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse20 .cse6 .cse8 .cse9) (and .cse1 .cse17 .cse3 .cse4 .cse11 .cse6) (and .cse14 .cse10 .cse0 .cse1 .cse2 .cse6 .cse15 .cse9) (and .cse19 .cse18 .cse1 .cse17 .cse4 .cse6 .cse11) (and .cse19 .cse1 .cse17 .cse4 .cse20 .cse11 .cse6) (and .cse10 .cse18 .cse1 .cse4 .cse11 .cse12) (and .cse14 .cse0 .cse1 .cse2 .cse17 .cse3 .cse6 .cse15 .cse9) (and .cse14 .cse10 .cse1 .cse2 .cse4 .cse6 .cse8) (and .cse14 .cse0 .cse1 .cse2 .cse17 .cse4 .cse6 .cse7 .cse8) (and .cse18 .cse1 .cse2 .cse17 .cse3 .cse6 .cse15) (and .cse10 (or (and .cse0 .cse1 .cse2 .cse15 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse6 .cse15 .cse13))) (and .cse14 .cse10 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse10 .cse0 .cse1 .cse4 .cse5 .cse11 .cse6 .cse7 .cse13) (and .cse19 .cse10 .cse0 .cse1 .cse2 .cse6 .cse15) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse12 .cse9 .cse8 .cse21) (and .cse14 .cse10 .cse1 .cse2 .cse4 .cse12 .cse9 .cse21) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse9 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9)) .cse20) (and .cse10 .cse18 .cse1 .cse3 .cse11 .cse15 .cse12 .cse8) (and .cse14 .cse10 .cse0 .cse1 .cse11 .cse7 .cse15 .cse12) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse20 .cse12 .cse8) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse7 .cse12 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse20 .cse5 .cse15 .cse12 .cse8 .cse13) (and .cse19 .cse0 .cse1 .cse3 .cse4 .cse20 .cse5 .cse7 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse17 .cse4 .cse12 .cse8) (and .cse14 .cse10 .cse1 .cse2 .cse15 .cse12) (and .cse14 .cse16 .cse10 .cse1 .cse3 .cse6 .cse15) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse20 .cse12 .cse9 .cse21) (and .cse14 .cse10 .cse16 .cse1 .cse6 .cse15 .cse8) (and .cse10 .cse0 .cse18 .cse1 .cse3 .cse15 .cse12 .cse13) (and .cse14 .cse10 .cse0 .cse1 .cse2 .cse3 .cse6 .cse15) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse15 .cse13) (and .cse1 .cse17 .cse3 .cse4 .cse6 .cse8) (and .cse10 .cse18 .cse1 .cse20 .cse11 .cse15 .cse12 .cse8) (and .cse14 .cse0 .cse1 .cse2 .cse17 .cse4 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse6 .cse7 .cse13) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse12 .cse9)) .cse19) (and .cse10 .cse0 .cse18 .cse1 .cse4 .cse12) (and .cse14 .cse10 .cse0 .cse1 .cse4 .cse6 .cse8) (and .cse0 .cse1 .cse17 .cse4 .cse12 .cse9)))) [2019-12-07 19:09:22,526 INFO L246 CegarLoopResult]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,526 INFO L246 CegarLoopResult]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,526 INFO L246 CegarLoopResult]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,526 INFO L246 CegarLoopResult]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-12-07 19:09:22,526 INFO L246 CegarLoopResult]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-12-07 19:09:22,526 INFO L246 CegarLoopResult]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,526 INFO L246 CegarLoopResult]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,526 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 19:09:22,527 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1506) no Hoare annotation was computed. [2019-12-07 19:09:22,527 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,527 INFO L249 CegarLoopResult]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-12-07 19:09:22,527 INFO L246 CegarLoopResult]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,527 INFO L246 CegarLoopResult]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,527 INFO L246 CegarLoopResult]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,527 INFO L246 CegarLoopResult]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,527 INFO L246 CegarLoopResult]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,527 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,527 INFO L246 CegarLoopResult]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-12-07 19:09:22,527 INFO L246 CegarLoopResult]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-12-07 19:09:22,527 INFO L246 CegarLoopResult]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,527 INFO L246 CegarLoopResult]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,527 INFO L246 CegarLoopResult]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,527 INFO L246 CegarLoopResult]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,528 INFO L246 CegarLoopResult]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,528 INFO L246 CegarLoopResult]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,528 INFO L246 CegarLoopResult]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,528 INFO L246 CegarLoopResult]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,528 INFO L246 CegarLoopResult]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,528 INFO L246 CegarLoopResult]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-12-07 19:09:22,528 INFO L246 CegarLoopResult]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-12-07 19:09:22,528 INFO L246 CegarLoopResult]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,528 INFO L246 CegarLoopResult]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,528 INFO L246 CegarLoopResult]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-12-07 19:09:22,528 INFO L246 CegarLoopResult]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-12-07 19:09:22,528 INFO L246 CegarLoopResult]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,529 INFO L242 CegarLoopResult]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse5 (= 0 ~a3~0)) (.cse2 (= 1 ~a6~0))) (let ((.cse21 (<= ~a23~0 0)) (.cse16 (<= ~a6~0 0)) (.cse20 (= ~a17~0 1)) (.cse11 (not .cse2)) (.cse15 (= ~a11~0 1)) (.cse13 (= ~a15~0 1)) (.cse3 (not (= 1 ~a7~0))) (.cse7 (= ~a29~0 1)) (.cse19 (<= ~a4~0 0)) (.cse18 (= 1 ~a3~0)) (.cse14 (not .cse5)) (.cse10 (<= ~a12~0 0)) (.cse6 (<= ~a26~0 0)) (.cse8 (= 1 ~a0~0)) (.cse0 (= ~a27~0 1)) (.cse1 (= 1 ~a5~0)) (.cse17 (= ~a12~0 1)) (.cse4 (<= ~a11~0 0)) (.cse12 (= ~a26~0 1)) (.cse9 (= ~a16~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse4 .cse11 .cse12 .cse13) (and .cse14 .cse10 .cse0 .cse1 .cse11 .cse15 .cse12 .cse8 .cse13) (and .cse10 .cse0 .cse1 .cse5 .cse11 .cse6 .cse7 .cse15) (and .cse14 .cse16 .cse0 .cse1 .cse17 .cse4 .cse6 .cse8) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse9) (and .cse10 .cse18 .cse1 .cse3 .cse4 .cse12 .cse8) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse19 .cse0 .cse1 .cse4 .cse20 .cse5 .cse11 .cse12 .cse8 .cse13) (and .cse0 .cse1 .cse17 .cse4 .cse12 .cse13) (and .cse0 .cse1 .cse17 .cse4 .cse7 .cse12 .cse8) (and .cse1 .cse17 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse15 .cse12 .cse9) (and .cse10 .cse0 .cse1 .cse4 .cse11 .cse6 .cse8 .cse13) (and .cse14 .cse0 .cse1 .cse17 .cse3 .cse4 .cse6 .cse7) (and .cse19 .cse10 .cse1 .cse2 .cse15 .cse12 .cse8) (and .cse19 .cse0 .cse1 .cse4 .cse20 .cse5 .cse7 .cse11 .cse12 .cse9 .cse13) (and .cse1 .cse17 .cse4 .cse11 .cse12) (and .cse19 .cse0 .cse18 .cse1 .cse2 .cse4 .cse7 .cse12) (and .cse10 .cse0 .cse1 .cse11 .cse6 .cse15 .cse8) (and .cse16 .cse10 .cse1 .cse5 .cse7 .cse15 .cse12 .cse8) (and .cse16 .cse1 .cse3 .cse5 .cse7 .cse15 .cse12 .cse8) (and .cse19 .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse15 .cse9) (and .cse19 .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9) (and .cse14 .cse10 .cse0 .cse1 .cse2 .cse4 .cse12 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse12 .cse8) (and .cse18 .cse1 .cse17 .cse4 .cse6 .cse11 .cse8) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse15 .cse9) (and .cse0 .cse1 .cse3 .cse15 .cse12 .cse9)) .cse10) (and .cse10 .cse16 .cse1 .cse5 .cse15 .cse12 .cse9 .cse8 .cse21) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse6 .cse8) (and .cse10 .cse0 .cse18 .cse1 .cse3 .cse6 .cse15 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse15 .cse9) (and .cse10 .cse0 .cse1 .cse11 .cse15 .cse12 .cse9) (and .cse0 .cse1 .cse2 .cse17 .cse5 .cse6 .cse15 .cse8 .cse13) (and .cse19 .cse10 .cse1 .cse2 .cse3 .cse4 .cse12) (and .cse14 .cse10 .cse1 .cse2 .cse3 .cse4 .cse7 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse12 .cse8 .cse13) (and .cse19 .cse0 .cse18 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse12 .cse9 .cse8) (and .cse1 .cse2 .cse5 .cse7 .cse15 .cse12 .cse8) (and .cse1 .cse17 .cse3 .cse4 .cse12) (and .cse10 .cse0 .cse1 .cse4 .cse11 .cse6 .cse7 .cse8) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse12 .cse8 .cse13) (and .cse10 .cse1 .cse18 .cse4 .cse6 .cse8) (and .cse0 .cse1 .cse2 .cse5 .cse7 .cse15 .cse12 .cse13) (and .cse14 .cse10 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse10 .cse0 .cse1 .cse4 .cse5 .cse11 .cse6 .cse7 .cse9) (and .cse19 .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse20 .cse6 .cse8 .cse9) (and .cse1 .cse17 .cse3 .cse4 .cse11 .cse6) (and .cse14 .cse10 .cse0 .cse1 .cse2 .cse6 .cse15 .cse9) (and .cse19 .cse18 .cse1 .cse17 .cse4 .cse6 .cse11) (and .cse19 .cse1 .cse17 .cse4 .cse20 .cse11 .cse6) (and .cse10 .cse18 .cse1 .cse4 .cse11 .cse12) (and .cse14 .cse0 .cse1 .cse2 .cse17 .cse3 .cse6 .cse15 .cse9) (and .cse14 .cse10 .cse1 .cse2 .cse4 .cse6 .cse8) (and .cse14 .cse0 .cse1 .cse2 .cse17 .cse4 .cse6 .cse7 .cse8) (and .cse18 .cse1 .cse2 .cse17 .cse3 .cse6 .cse15) (and .cse10 (or (and .cse0 .cse1 .cse2 .cse15 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse6 .cse15 .cse13))) (and .cse14 .cse10 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse10 .cse0 .cse1 .cse4 .cse5 .cse11 .cse6 .cse7 .cse13) (and .cse19 .cse10 .cse0 .cse1 .cse2 .cse6 .cse15) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse12 .cse9 .cse8 .cse21) (and .cse14 .cse10 .cse1 .cse2 .cse4 .cse12 .cse9 .cse21) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse9 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9)) .cse20) (and .cse10 .cse18 .cse1 .cse3 .cse11 .cse15 .cse12 .cse8) (and .cse14 .cse10 .cse0 .cse1 .cse11 .cse7 .cse15 .cse12) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse20 .cse12 .cse8) (and .cse0 .cse18 .cse1 .cse2 .cse4 .cse7 .cse12 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse20 .cse5 .cse15 .cse12 .cse8 .cse13) (and .cse19 .cse0 .cse1 .cse3 .cse4 .cse20 .cse5 .cse7 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse17 .cse4 .cse12 .cse8) (and .cse14 .cse10 .cse1 .cse2 .cse15 .cse12) (and .cse14 .cse16 .cse10 .cse1 .cse3 .cse6 .cse15) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse20 .cse12 .cse9 .cse21) (and .cse14 .cse10 .cse16 .cse1 .cse6 .cse15 .cse8) (and .cse10 .cse0 .cse18 .cse1 .cse3 .cse15 .cse12 .cse13) (and .cse14 .cse10 .cse0 .cse1 .cse2 .cse3 .cse6 .cse15) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse15 .cse13) (and .cse1 .cse17 .cse3 .cse4 .cse6 .cse8) (and .cse10 .cse18 .cse1 .cse20 .cse11 .cse15 .cse12 .cse8) (and .cse14 .cse0 .cse1 .cse2 .cse17 .cse4 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse6 .cse7 .cse13) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse12 .cse9)) .cse19) (and .cse10 .cse0 .cse18 .cse1 .cse4 .cse12) (and .cse14 .cse10 .cse0 .cse1 .cse4 .cse6 .cse8) (and .cse0 .cse1 .cse17 .cse4 .cse12 .cse9)))) [2019-12-07 19:09:22,529 INFO L246 CegarLoopResult]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,529 INFO L246 CegarLoopResult]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,529 INFO L246 CegarLoopResult]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,529 INFO L246 CegarLoopResult]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,530 INFO L246 CegarLoopResult]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-12-07 19:09:22,530 INFO L246 CegarLoopResult]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-12-07 19:09:22,530 INFO L246 CegarLoopResult]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,530 INFO L246 CegarLoopResult]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,530 INFO L246 CegarLoopResult]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,530 INFO L246 CegarLoopResult]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,530 INFO L246 CegarLoopResult]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,530 INFO L246 CegarLoopResult]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,530 INFO L246 CegarLoopResult]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,530 INFO L246 CegarLoopResult]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,530 INFO L246 CegarLoopResult]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-12-07 19:09:22,530 INFO L246 CegarLoopResult]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-12-07 19:09:22,530 INFO L246 CegarLoopResult]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-12-07 19:09:22,530 INFO L246 CegarLoopResult]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,530 INFO L246 CegarLoopResult]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-12-07 19:09:22,531 INFO L246 CegarLoopResult]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,531 INFO L246 CegarLoopResult]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,531 INFO L246 CegarLoopResult]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-12-07 19:09:22,531 INFO L246 CegarLoopResult]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,531 INFO L246 CegarLoopResult]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,531 INFO L246 CegarLoopResult]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,531 INFO L246 CegarLoopResult]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,531 INFO L246 CegarLoopResult]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,531 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-12-07 19:09:22,531 INFO L246 CegarLoopResult]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,531 INFO L246 CegarLoopResult]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-12-07 19:09:22,531 INFO L246 CegarLoopResult]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-12-07 19:09:22,531 INFO L246 CegarLoopResult]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-12-07 19:09:22,531 INFO L246 CegarLoopResult]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,531 INFO L246 CegarLoopResult]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,532 INFO L246 CegarLoopResult]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,532 INFO L246 CegarLoopResult]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,532 INFO L246 CegarLoopResult]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,532 INFO L246 CegarLoopResult]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,532 INFO L246 CegarLoopResult]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,532 INFO L246 CegarLoopResult]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,532 INFO L246 CegarLoopResult]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-12-07 19:09:22,532 INFO L246 CegarLoopResult]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-12-07 19:09:22,532 INFO L246 CegarLoopResult]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,532 INFO L246 CegarLoopResult]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,532 INFO L246 CegarLoopResult]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-12-07 19:09:22,532 INFO L246 CegarLoopResult]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-12-07 19:09:22,532 INFO L246 CegarLoopResult]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-12-07 19:09:22,532 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,532 INFO L246 CegarLoopResult]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,532 INFO L246 CegarLoopResult]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,532 INFO L246 CegarLoopResult]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,533 INFO L246 CegarLoopResult]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,533 INFO L246 CegarLoopResult]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,533 INFO L246 CegarLoopResult]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,533 INFO L246 CegarLoopResult]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,533 INFO L246 CegarLoopResult]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,533 INFO L246 CegarLoopResult]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,533 INFO L246 CegarLoopResult]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,533 INFO L246 CegarLoopResult]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-12-07 19:09:22,533 INFO L246 CegarLoopResult]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-12-07 19:09:22,533 INFO L246 CegarLoopResult]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-12-07 19:09:22,533 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 19:09:22,533 INFO L246 CegarLoopResult]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,533 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,533 INFO L246 CegarLoopResult]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,533 INFO L246 CegarLoopResult]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,533 INFO L246 CegarLoopResult]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,533 INFO L246 CegarLoopResult]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,533 INFO L246 CegarLoopResult]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,534 INFO L246 CegarLoopResult]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-12-07 19:09:22,534 INFO L246 CegarLoopResult]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-12-07 19:09:22,534 INFO L246 CegarLoopResult]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,534 INFO L246 CegarLoopResult]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-12-07 19:09:22,534 INFO L246 CegarLoopResult]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-12-07 19:09:22,534 INFO L246 CegarLoopResult]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-12-07 19:09:22,534 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,534 INFO L246 CegarLoopResult]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,534 INFO L246 CegarLoopResult]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,534 INFO L246 CegarLoopResult]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,534 INFO L246 CegarLoopResult]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,534 INFO L246 CegarLoopResult]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-12-07 19:09:22,534 INFO L246 CegarLoopResult]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-12-07 19:09:22,534 INFO L246 CegarLoopResult]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,534 INFO L246 CegarLoopResult]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,534 INFO L246 CegarLoopResult]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,535 INFO L246 CegarLoopResult]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-12-07 19:09:22,535 INFO L246 CegarLoopResult]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-12-07 19:09:22,535 INFO L246 CegarLoopResult]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,535 INFO L246 CegarLoopResult]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-12-07 19:09:22,535 INFO L246 CegarLoopResult]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,535 INFO L246 CegarLoopResult]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,535 INFO L246 CegarLoopResult]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,535 INFO L246 CegarLoopResult]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,535 INFO L246 CegarLoopResult]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,535 INFO L246 CegarLoopResult]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,535 INFO L246 CegarLoopResult]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,535 INFO L246 CegarLoopResult]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,535 INFO L246 CegarLoopResult]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,535 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,535 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 19:09:22,535 INFO L246 CegarLoopResult]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-12-07 19:09:22,536 INFO L246 CegarLoopResult]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-12-07 19:09:22,536 INFO L246 CegarLoopResult]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-12-07 19:09:22,536 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,536 INFO L246 CegarLoopResult]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-12-07 19:09:22,536 INFO L246 CegarLoopResult]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-12-07 19:09:22,536 INFO L246 CegarLoopResult]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,536 INFO L246 CegarLoopResult]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,536 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,536 INFO L246 CegarLoopResult]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,536 INFO L246 CegarLoopResult]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,536 INFO L246 CegarLoopResult]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,536 INFO L246 CegarLoopResult]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,536 INFO L246 CegarLoopResult]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,536 INFO L246 CegarLoopResult]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,536 INFO L246 CegarLoopResult]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-12-07 19:09:22,536 INFO L246 CegarLoopResult]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-12-07 19:09:22,536 INFO L246 CegarLoopResult]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-12-07 19:09:22,537 INFO L246 CegarLoopResult]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,537 INFO L246 CegarLoopResult]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,537 INFO L246 CegarLoopResult]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,537 INFO L246 CegarLoopResult]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,537 INFO L246 CegarLoopResult]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 19:09:22,537 INFO L246 CegarLoopResult]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,537 INFO L246 CegarLoopResult]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-12-07 19:09:22,537 INFO L246 CegarLoopResult]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-12-07 19:09:22,537 INFO L246 CegarLoopResult]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,537 INFO L246 CegarLoopResult]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-12-07 19:09:22,537 INFO L246 CegarLoopResult]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-12-07 19:09:22,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:09:22 BoogieIcfgContainer [2019-12-07 19:09:22,598 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:09:22,599 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:09:22,599 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:09:22,599 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:09:22,599 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:02:10" (3/4) ... [2019-12-07 19:09:22,601 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 19:09:22,626 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 19:09:22,629 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 19:09:22,753 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6bcc7ace-0aec-4237-9562-2e8a4749da9e/bin/uautomizer/witness.graphml [2019-12-07 19:09:22,754 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:09:22,755 INFO L168 Benchmark]: Toolchain (without parser) took 434241.36 ms. Allocated memory was 1.0 GB in the beginning and 7.2 GB in the end (delta: 6.2 GB). Free memory was 939.3 MB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2019-12-07 19:09:22,755 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:09:22,755 INFO L168 Benchmark]: CACSL2BoogieTranslator took 577.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -86.9 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:09:22,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:09:22,755 INFO L168 Benchmark]: Boogie Preprocessor took 62.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 999.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:09:22,755 INFO L168 Benchmark]: RCFGBuilder took 1203.56 ms. Allocated memory is still 1.1 GB. Free memory was 999.3 MB in the beginning and 978.2 MB in the end (delta: 21.1 MB). Peak memory consumption was 189.8 MB. Max. memory is 11.5 GB. [2019-12-07 19:09:22,756 INFO L168 Benchmark]: TraceAbstraction took 432162.24 ms. Allocated memory was 1.1 GB in the beginning and 7.2 GB in the end (delta: 6.1 GB). Free memory was 978.2 MB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 6.3 GB. Max. memory is 11.5 GB. [2019-12-07 19:09:22,756 INFO L168 Benchmark]: Witness Printer took 155.13 ms. Allocated memory is still 7.2 GB. Free memory was 3.7 GB in the beginning and 3.7 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-12-07 19:09:22,757 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 577.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -86.9 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 999.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1203.56 ms. Allocated memory is still 1.1 GB. Free memory was 999.3 MB in the beginning and 978.2 MB in the end (delta: 21.1 MB). Peak memory consumption was 189.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 432162.24 ms. Allocated memory was 1.1 GB in the beginning and 7.2 GB in the end (delta: 6.1 GB). Free memory was 978.2 MB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 6.3 GB. Max. memory is 11.5 GB. * Witness Printer took 155.13 ms. Allocated memory is still 7.2 GB. Free memory was 3.7 GB in the beginning and 3.7 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1506]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && 0 == a3) && a26 <= 0) && a29 == 1) && 1 == a0) && a16 == 1) || ((((((a12 <= 0 && a27 == 1) && 1 == a5) && a11 <= 0) && !(1 == a6)) && a26 == 1) && a15 == 1)) || ((((((((!(0 == a3) && a12 <= 0) && a27 == 1) && 1 == a5) && !(1 == a6)) && a11 == 1) && a26 == 1) && 1 == a0) && a15 == 1)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && 0 == a3) && !(1 == a6)) && a26 <= 0) && a29 == 1) && a11 == 1)) || (((((((!(0 == a3) && a6 <= 0) && a27 == 1) && 1 == a5) && a12 == 1) && a11 <= 0) && a26 <= 0) && 1 == a0)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a26 == 1) && a16 == 1)) || ((((((a12 <= 0 && 1 == a3) && 1 == a5) && !(1 == a7)) && a11 <= 0) && a26 == 1) && 1 == a0)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && !(1 == a7)) && a11 <= 0) && 0 == a3) && a26 <= 0) && a29 == 1)) || (((((((((a4 <= 0 && a27 == 1) && 1 == a5) && a11 <= 0) && a17 == 1) && 0 == a3) && !(1 == a6)) && a26 == 1) && 1 == a0) && a15 == 1)) || (((((a27 == 1 && 1 == a5) && a12 == 1) && a11 <= 0) && a26 == 1) && a15 == 1)) || ((((((a27 == 1 && 1 == a5) && a12 == 1) && a11 <= 0) && a29 == 1) && a26 == 1) && 1 == a0)) || (((1 == a5 && a12 == 1) && a11 == 1) && a26 == 1)) || ((((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && 0 == a3) && a29 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && a11 <= 0) && !(1 == a6)) && a26 <= 0) && 1 == a0) && a15 == 1)) || (((((((!(0 == a3) && a27 == 1) && 1 == a5) && a12 == 1) && !(1 == a7)) && a11 <= 0) && a26 <= 0) && a29 == 1)) || ((((((a4 <= 0 && a12 <= 0) && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1) && 1 == a0)) || ((((((((((a4 <= 0 && a27 == 1) && 1 == a5) && a11 <= 0) && a17 == 1) && 0 == a3) && a29 == 1) && !(1 == a6)) && a26 == 1) && a16 == 1) && a15 == 1)) || ((((1 == a5 && a12 == 1) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || (((((((a4 <= 0 && a27 == 1) && 1 == a3) && 1 == a5) && 1 == a6) && a11 <= 0) && a29 == 1) && a26 == 1)) || ((((((a12 <= 0 && a27 == 1) && 1 == a5) && !(1 == a6)) && a26 <= 0) && a11 == 1) && 1 == a0)) || (((((((a6 <= 0 && a12 <= 0) && 1 == a5) && 0 == a3) && a29 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) || (((((((a6 <= 0 && 1 == a5) && !(1 == a7)) && 0 == a3) && a29 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) || ((((((((a4 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && 0 == a3) && a26 <= 0) && a29 == 1) && a11 == 1) && a16 == 1)) || (((((((((a4 <= 0 && a27 == 1) && 1 == a3) && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a26 <= 0) && a29 == 1) && a16 == 1)) || (((((((!(0 == a3) && a12 <= 0) && a27 == 1) && 1 == a5) && 1 == a6) && a11 <= 0) && a26 == 1) && 1 == a0)) || (((((((1 == a5 && 1 == a6) && !(1 == a7)) && a11 <= 0) && 0 == a3) && a29 == 1) && a26 == 1) && 1 == a0)) || ((((((1 == a3 && 1 == a5) && a12 == 1) && a11 <= 0) && a26 <= 0) && !(1 == a6)) && 1 == a0)) || ((((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a26 <= 0) && a11 == 1) && a16 == 1) || (((((a27 == 1 && 1 == a5) && !(1 == a7)) && a11 == 1) && a26 == 1) && a16 == 1)) && a12 <= 0)) || ((((((((a12 <= 0 && a6 <= 0) && 1 == a5) && 0 == a3) && a11 == 1) && a26 == 1) && a16 == 1) && 1 == a0) && a23 <= 0)) || ((((((a12 <= 0 && a27 == 1) && 1 == a5) && !(1 == a7)) && a11 <= 0) && a26 <= 0) && 1 == a0)) || (((((((a12 <= 0 && a27 == 1) && 1 == a3) && 1 == a5) && !(1 == a7)) && a26 <= 0) && a11 == 1) && a16 == 1)) || ((((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && 0 == a3) && a26 <= 0) && a29 == 1) && a11 == 1) && a16 == 1)) || ((((((a12 <= 0 && a27 == 1) && 1 == a5) && !(1 == a6)) && a11 == 1) && a26 == 1) && a16 == 1)) || ((((((((a27 == 1 && 1 == a5) && 1 == a6) && a12 == 1) && 0 == a3) && a26 <= 0) && a11 == 1) && 1 == a0) && a15 == 1)) || ((((((a4 <= 0 && a12 <= 0) && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a26 == 1)) || (((((((!(0 == a3) && a12 <= 0) && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a29 == 1) && a26 == 1)) || (((((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a17 == 1) && 0 == a3) && a26 == 1) && 1 == a0) && a15 == 1)) || ((((((((a4 <= 0 && a27 == 1) && 1 == a3) && 1 == a5) && 1 == a6) && a11 <= 0) && a26 <= 0) && a29 == 1) && 1 == a0)) || ((((((((a27 == 1 && 1 == a5) && 1 == a6) && a11 <= 0) && 0 == a3) && a29 == 1) && a26 == 1) && a16 == 1) && 1 == a0)) || ((((((1 == a5 && 1 == a6) && 0 == a3) && a29 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) || ((((1 == a5 && a12 == 1) && !(1 == a7)) && a11 <= 0) && a26 == 1)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && a11 <= 0) && !(1 == a6)) && a26 <= 0) && a29 == 1) && 1 == a0)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && !(1 == a7)) && a11 <= 0) && a26 == 1) && 1 == a0) && a15 == 1)) || (((((a12 <= 0 && 1 == a5) && 1 == a3) && a11 <= 0) && a26 <= 0) && 1 == a0)) || (((((((a27 == 1 && 1 == a5) && 1 == a6) && 0 == a3) && a29 == 1) && a11 == 1) && a26 == 1) && a15 == 1)) || ((((((!(0 == a3) && a12 <= 0) && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a26 <= 0)) || ((((((((a12 <= 0 && a27 == 1) && 1 == a5) && a11 <= 0) && 0 == a3) && !(1 == a6)) && a26 <= 0) && a29 == 1) && a16 == 1)) || ((((((((((a4 <= 0 && a27 == 1) && 1 == a3) && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a17 == 1) && a26 <= 0) && 1 == a0) && a16 == 1)) || (((((1 == a5 && a12 == 1) && !(1 == a7)) && a11 <= 0) && !(1 == a6)) && a26 <= 0)) || (((((((!(0 == a3) && a12 <= 0) && a27 == 1) && 1 == a5) && 1 == a6) && a26 <= 0) && a11 == 1) && a16 == 1)) || ((((((a4 <= 0 && 1 == a3) && 1 == a5) && a12 == 1) && a11 <= 0) && a26 <= 0) && !(1 == a6))) || ((((((a4 <= 0 && 1 == a5) && a12 == 1) && a11 <= 0) && a17 == 1) && !(1 == a6)) && a26 <= 0)) || (((((a12 <= 0 && 1 == a3) && 1 == a5) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || ((((((((!(0 == a3) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a26 <= 0) && a11 == 1) && a16 == 1)) || ((((((!(0 == a3) && a12 <= 0) && 1 == a5) && 1 == a6) && a11 <= 0) && a26 <= 0) && 1 == a0)) || ((((((((!(0 == a3) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && a11 <= 0) && a26 <= 0) && a29 == 1) && 1 == a0)) || ((((((1 == a3 && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a26 <= 0) && a11 == 1)) || (a12 <= 0 && ((((((a27 == 1 && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1) && a15 == 1) || (((((a27 == 1 && 1 == a5) && 1 == a6) && a26 <= 0) && a11 == 1) && a15 == 1)))) || ((((((!(0 == a3) && a12 <= 0) && a27 == 1) && 1 == a5) && 1 == a6) && a11 <= 0) && a26 <= 0)) || ((((((((a12 <= 0 && a27 == 1) && 1 == a5) && a11 <= 0) && 0 == a3) && !(1 == a6)) && a26 <= 0) && a29 == 1) && a15 == 1)) || ((((((a4 <= 0 && a12 <= 0) && a27 == 1) && 1 == a5) && 1 == a6) && a26 <= 0) && a11 == 1)) || ((((((((a12 <= 0 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a26 == 1) && a16 == 1) && 1 == a0) && a23 <= 0)) || (((((((!(0 == a3) && a12 <= 0) && 1 == a5) && 1 == a6) && a11 <= 0) && a26 == 1) && a16 == 1) && a23 <= 0)) || ((((((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && 0 == a3) && a26 == 1) && a16 == 1) && 1 == a0) || ((((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && 0 == a3) && a26 <= 0) && 1 == a0) && a16 == 1)) && a17 == 1)) || (((((((a12 <= 0 && 1 == a3) && 1 == a5) && !(1 == a7)) && !(1 == a6)) && a11 == 1) && a26 == 1) && 1 == a0)) || (((((((!(0 == a3) && a12 <= 0) && a27 == 1) && 1 == a5) && !(1 == a6)) && a29 == 1) && a11 == 1) && a26 == 1)) || (((((((a27 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a11 <= 0) && a17 == 1) && a26 == 1) && 1 == a0)) || (((((((a27 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a11 <= 0) && a29 == 1) && a26 == 1) && 1 == a0)) || (((((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a17 == 1) && 0 == a3) && a11 == 1) && a26 == 1) && 1 == a0) && a15 == 1)) || ((((((((((a4 <= 0 && a27 == 1) && 1 == a5) && !(1 == a7)) && a11 <= 0) && a17 == 1) && 0 == a3) && a29 == 1) && !(1 == a6)) && a26 == 1) && a15 == 1)) || (((((!(0 == a3) && 1 == a5) && a12 == 1) && a11 <= 0) && a26 == 1) && 1 == a0)) || (((((!(0 == a3) && a12 <= 0) && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1)) || ((((((!(0 == a3) && a6 <= 0) && a12 <= 0) && 1 == a5) && !(1 == a7)) && a26 <= 0) && a11 == 1)) || ((((((((a12 <= 0 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a17 == 1) && a26 == 1) && a16 == 1) && a23 <= 0)) || ((((((!(0 == a3) && a12 <= 0) && a6 <= 0) && 1 == a5) && a26 <= 0) && a11 == 1) && 1 == a0)) || (((((((a12 <= 0 && a27 == 1) && 1 == a3) && 1 == a5) && !(1 == a7)) && a11 == 1) && a26 == 1) && a15 == 1)) || (((((((!(0 == a3) && a12 <= 0) && a27 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && a26 <= 0) && a11 == 1)) || (((((((a27 == 1 && 1 == a5) && 1 == a6) && 0 == a3) && a26 <= 0) && a29 == 1) && a11 == 1) && a15 == 1)) || (((((1 == a5 && a12 == 1) && !(1 == a7)) && a11 <= 0) && a26 <= 0) && 1 == a0)) || (((((((a12 <= 0 && 1 == a3) && 1 == a5) && a17 == 1) && !(1 == a6)) && a11 == 1) && a26 == 1) && 1 == a0)) || ((((((((!(0 == a3) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && a11 <= 0) && a26 <= 0) && a29 == 1) && a16 == 1)) || (((((((a27 == 1 && 1 == a5) && 1 == a6) && a12 == 1) && a11 <= 0) && a26 <= 0) && a29 == 1) && a15 == 1)) || ((((((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && 0 == a3) && a26 <= 0) && a29 == 1) && a16 == 1) || ((((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && 0 == a3) && a29 == 1) && a26 == 1) && a16 == 1)) && a4 <= 0)) || (((((a12 <= 0 && a27 == 1) && 1 == a3) && 1 == a5) && a11 <= 0) && a26 == 1)) || ((((((!(0 == a3) && a12 <= 0) && a27 == 1) && 1 == a5) && a11 <= 0) && a26 <= 0) && 1 == a0)) || (((((a27 == 1 && 1 == a5) && a12 == 1) && a11 <= 0) && a26 == 1) && a16 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && 0 == a3) && a26 <= 0) && a29 == 1) && 1 == a0) && a16 == 1) || ((((((a12 <= 0 && a27 == 1) && 1 == a5) && a11 <= 0) && !(1 == a6)) && a26 == 1) && a15 == 1)) || ((((((((!(0 == a3) && a12 <= 0) && a27 == 1) && 1 == a5) && !(1 == a6)) && a11 == 1) && a26 == 1) && 1 == a0) && a15 == 1)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && 0 == a3) && !(1 == a6)) && a26 <= 0) && a29 == 1) && a11 == 1)) || (((((((!(0 == a3) && a6 <= 0) && a27 == 1) && 1 == a5) && a12 == 1) && a11 <= 0) && a26 <= 0) && 1 == a0)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a26 == 1) && a16 == 1)) || ((((((a12 <= 0 && 1 == a3) && 1 == a5) && !(1 == a7)) && a11 <= 0) && a26 == 1) && 1 == a0)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && !(1 == a7)) && a11 <= 0) && 0 == a3) && a26 <= 0) && a29 == 1)) || (((((((((a4 <= 0 && a27 == 1) && 1 == a5) && a11 <= 0) && a17 == 1) && 0 == a3) && !(1 == a6)) && a26 == 1) && 1 == a0) && a15 == 1)) || (((((a27 == 1 && 1 == a5) && a12 == 1) && a11 <= 0) && a26 == 1) && a15 == 1)) || ((((((a27 == 1 && 1 == a5) && a12 == 1) && a11 <= 0) && a29 == 1) && a26 == 1) && 1 == a0)) || (((1 == a5 && a12 == 1) && a11 == 1) && a26 == 1)) || ((((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && 0 == a3) && a29 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && a11 <= 0) && !(1 == a6)) && a26 <= 0) && 1 == a0) && a15 == 1)) || (((((((!(0 == a3) && a27 == 1) && 1 == a5) && a12 == 1) && !(1 == a7)) && a11 <= 0) && a26 <= 0) && a29 == 1)) || ((((((a4 <= 0 && a12 <= 0) && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1) && 1 == a0)) || ((((((((((a4 <= 0 && a27 == 1) && 1 == a5) && a11 <= 0) && a17 == 1) && 0 == a3) && a29 == 1) && !(1 == a6)) && a26 == 1) && a16 == 1) && a15 == 1)) || ((((1 == a5 && a12 == 1) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || (((((((a4 <= 0 && a27 == 1) && 1 == a3) && 1 == a5) && 1 == a6) && a11 <= 0) && a29 == 1) && a26 == 1)) || ((((((a12 <= 0 && a27 == 1) && 1 == a5) && !(1 == a6)) && a26 <= 0) && a11 == 1) && 1 == a0)) || (((((((a6 <= 0 && a12 <= 0) && 1 == a5) && 0 == a3) && a29 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) || (((((((a6 <= 0 && 1 == a5) && !(1 == a7)) && 0 == a3) && a29 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) || ((((((((a4 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && 0 == a3) && a26 <= 0) && a29 == 1) && a11 == 1) && a16 == 1)) || (((((((((a4 <= 0 && a27 == 1) && 1 == a3) && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a26 <= 0) && a29 == 1) && a16 == 1)) || (((((((!(0 == a3) && a12 <= 0) && a27 == 1) && 1 == a5) && 1 == a6) && a11 <= 0) && a26 == 1) && 1 == a0)) || (((((((1 == a5 && 1 == a6) && !(1 == a7)) && a11 <= 0) && 0 == a3) && a29 == 1) && a26 == 1) && 1 == a0)) || ((((((1 == a3 && 1 == a5) && a12 == 1) && a11 <= 0) && a26 <= 0) && !(1 == a6)) && 1 == a0)) || ((((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a26 <= 0) && a11 == 1) && a16 == 1) || (((((a27 == 1 && 1 == a5) && !(1 == a7)) && a11 == 1) && a26 == 1) && a16 == 1)) && a12 <= 0)) || ((((((((a12 <= 0 && a6 <= 0) && 1 == a5) && 0 == a3) && a11 == 1) && a26 == 1) && a16 == 1) && 1 == a0) && a23 <= 0)) || ((((((a12 <= 0 && a27 == 1) && 1 == a5) && !(1 == a7)) && a11 <= 0) && a26 <= 0) && 1 == a0)) || (((((((a12 <= 0 && a27 == 1) && 1 == a3) && 1 == a5) && !(1 == a7)) && a26 <= 0) && a11 == 1) && a16 == 1)) || ((((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && 0 == a3) && a26 <= 0) && a29 == 1) && a11 == 1) && a16 == 1)) || ((((((a12 <= 0 && a27 == 1) && 1 == a5) && !(1 == a6)) && a11 == 1) && a26 == 1) && a16 == 1)) || ((((((((a27 == 1 && 1 == a5) && 1 == a6) && a12 == 1) && 0 == a3) && a26 <= 0) && a11 == 1) && 1 == a0) && a15 == 1)) || ((((((a4 <= 0 && a12 <= 0) && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a26 == 1)) || (((((((!(0 == a3) && a12 <= 0) && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a29 == 1) && a26 == 1)) || (((((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a17 == 1) && 0 == a3) && a26 == 1) && 1 == a0) && a15 == 1)) || ((((((((a4 <= 0 && a27 == 1) && 1 == a3) && 1 == a5) && 1 == a6) && a11 <= 0) && a26 <= 0) && a29 == 1) && 1 == a0)) || ((((((((a27 == 1 && 1 == a5) && 1 == a6) && a11 <= 0) && 0 == a3) && a29 == 1) && a26 == 1) && a16 == 1) && 1 == a0)) || ((((((1 == a5 && 1 == a6) && 0 == a3) && a29 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) || ((((1 == a5 && a12 == 1) && !(1 == a7)) && a11 <= 0) && a26 == 1)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && a11 <= 0) && !(1 == a6)) && a26 <= 0) && a29 == 1) && 1 == a0)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && !(1 == a7)) && a11 <= 0) && a26 == 1) && 1 == a0) && a15 == 1)) || (((((a12 <= 0 && 1 == a5) && 1 == a3) && a11 <= 0) && a26 <= 0) && 1 == a0)) || (((((((a27 == 1 && 1 == a5) && 1 == a6) && 0 == a3) && a29 == 1) && a11 == 1) && a26 == 1) && a15 == 1)) || ((((((!(0 == a3) && a12 <= 0) && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a26 <= 0)) || ((((((((a12 <= 0 && a27 == 1) && 1 == a5) && a11 <= 0) && 0 == a3) && !(1 == a6)) && a26 <= 0) && a29 == 1) && a16 == 1)) || ((((((((((a4 <= 0 && a27 == 1) && 1 == a3) && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a17 == 1) && a26 <= 0) && 1 == a0) && a16 == 1)) || (((((1 == a5 && a12 == 1) && !(1 == a7)) && a11 <= 0) && !(1 == a6)) && a26 <= 0)) || (((((((!(0 == a3) && a12 <= 0) && a27 == 1) && 1 == a5) && 1 == a6) && a26 <= 0) && a11 == 1) && a16 == 1)) || ((((((a4 <= 0 && 1 == a3) && 1 == a5) && a12 == 1) && a11 <= 0) && a26 <= 0) && !(1 == a6))) || ((((((a4 <= 0 && 1 == a5) && a12 == 1) && a11 <= 0) && a17 == 1) && !(1 == a6)) && a26 <= 0)) || (((((a12 <= 0 && 1 == a3) && 1 == a5) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || ((((((((!(0 == a3) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a26 <= 0) && a11 == 1) && a16 == 1)) || ((((((!(0 == a3) && a12 <= 0) && 1 == a5) && 1 == a6) && a11 <= 0) && a26 <= 0) && 1 == a0)) || ((((((((!(0 == a3) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && a11 <= 0) && a26 <= 0) && a29 == 1) && 1 == a0)) || ((((((1 == a3 && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a26 <= 0) && a11 == 1)) || (a12 <= 0 && ((((((a27 == 1 && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1) && a15 == 1) || (((((a27 == 1 && 1 == a5) && 1 == a6) && a26 <= 0) && a11 == 1) && a15 == 1)))) || ((((((!(0 == a3) && a12 <= 0) && a27 == 1) && 1 == a5) && 1 == a6) && a11 <= 0) && a26 <= 0)) || ((((((((a12 <= 0 && a27 == 1) && 1 == a5) && a11 <= 0) && 0 == a3) && !(1 == a6)) && a26 <= 0) && a29 == 1) && a15 == 1)) || ((((((a4 <= 0 && a12 <= 0) && a27 == 1) && 1 == a5) && 1 == a6) && a26 <= 0) && a11 == 1)) || ((((((((a12 <= 0 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a26 == 1) && a16 == 1) && 1 == a0) && a23 <= 0)) || (((((((!(0 == a3) && a12 <= 0) && 1 == a5) && 1 == a6) && a11 <= 0) && a26 == 1) && a16 == 1) && a23 <= 0)) || ((((((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && 0 == a3) && a26 == 1) && a16 == 1) && 1 == a0) || ((((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && 0 == a3) && a26 <= 0) && 1 == a0) && a16 == 1)) && a17 == 1)) || (((((((a12 <= 0 && 1 == a3) && 1 == a5) && !(1 == a7)) && !(1 == a6)) && a11 == 1) && a26 == 1) && 1 == a0)) || (((((((!(0 == a3) && a12 <= 0) && a27 == 1) && 1 == a5) && !(1 == a6)) && a29 == 1) && a11 == 1) && a26 == 1)) || (((((((a27 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a11 <= 0) && a17 == 1) && a26 == 1) && 1 == a0)) || (((((((a27 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a11 <= 0) && a29 == 1) && a26 == 1) && 1 == a0)) || (((((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a17 == 1) && 0 == a3) && a11 == 1) && a26 == 1) && 1 == a0) && a15 == 1)) || ((((((((((a4 <= 0 && a27 == 1) && 1 == a5) && !(1 == a7)) && a11 <= 0) && a17 == 1) && 0 == a3) && a29 == 1) && !(1 == a6)) && a26 == 1) && a15 == 1)) || (((((!(0 == a3) && 1 == a5) && a12 == 1) && a11 <= 0) && a26 == 1) && 1 == a0)) || (((((!(0 == a3) && a12 <= 0) && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1)) || ((((((!(0 == a3) && a6 <= 0) && a12 <= 0) && 1 == a5) && !(1 == a7)) && a26 <= 0) && a11 == 1)) || ((((((((a12 <= 0 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a17 == 1) && a26 == 1) && a16 == 1) && a23 <= 0)) || ((((((!(0 == a3) && a12 <= 0) && a6 <= 0) && 1 == a5) && a26 <= 0) && a11 == 1) && 1 == a0)) || (((((((a12 <= 0 && a27 == 1) && 1 == a3) && 1 == a5) && !(1 == a7)) && a11 == 1) && a26 == 1) && a15 == 1)) || (((((((!(0 == a3) && a12 <= 0) && a27 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && a26 <= 0) && a11 == 1)) || (((((((a27 == 1 && 1 == a5) && 1 == a6) && 0 == a3) && a26 <= 0) && a29 == 1) && a11 == 1) && a15 == 1)) || (((((1 == a5 && a12 == 1) && !(1 == a7)) && a11 <= 0) && a26 <= 0) && 1 == a0)) || (((((((a12 <= 0 && 1 == a3) && 1 == a5) && a17 == 1) && !(1 == a6)) && a11 == 1) && a26 == 1) && 1 == a0)) || ((((((((!(0 == a3) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && a11 <= 0) && a26 <= 0) && a29 == 1) && a16 == 1)) || (((((((a27 == 1 && 1 == a5) && 1 == a6) && a12 == 1) && a11 <= 0) && a26 <= 0) && a29 == 1) && a15 == 1)) || ((((((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && 0 == a3) && a26 <= 0) && a29 == 1) && a16 == 1) || ((((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && 0 == a3) && a29 == 1) && a26 == 1) && a16 == 1)) && a4 <= 0)) || (((((a12 <= 0 && a27 == 1) && 1 == a3) && 1 == a5) && a11 <= 0) && a26 == 1)) || ((((((!(0 == a3) && a12 <= 0) && a27 == 1) && 1 == a5) && a11 <= 0) && a26 <= 0) && 1 == a0)) || (((((a27 == 1 && 1 == a5) && a12 == 1) && a11 <= 0) && a26 == 1) && a16 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 84.5s, OverallIterations: 21, TraceHistogramMax: 7, AutomataDifference: 42.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 347.4s, HoareTripleCheckerStatistics: 3619 SDtfs, 7838 SDslu, 1669 SDs, 0 SdLazy, 16513 SolverSat, 3181 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 754 GetRequests, 694 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=622372occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 35.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 150831 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 5718 NumberOfFragments, 4597 HoareAnnotationTreeSize, 3 FomulaSimplifications, 964374 FormulaSimplificationTreeSizeReduction, 214.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 374920 FormulaSimplificationTreeSizeReductionInter, 133.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 6553 NumberOfCodeBlocks, 6553 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 6530 ConstructedInterpolants, 0 QuantifiedInterpolants, 7450200 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1193 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 23 InterpolantComputations, 21 PerfectInterpolantSequences, 4653/4737 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...