./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8e332a50-2670-4739-a19a-77437fd37810/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8e332a50-2670-4739-a19a-77437fd37810/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8e332a50-2670-4739-a19a-77437fd37810/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8e332a50-2670-4739-a19a-77437fd37810/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label02.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8e332a50-2670-4739-a19a-77437fd37810/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8e332a50-2670-4739-a19a-77437fd37810/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 14021e9fff9123a734a262a9d34c71e4922bd817 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 01:42:25,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:42:25,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:42:25,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:42:25,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:42:25,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:42:25,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:42:25,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:42:25,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:42:25,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:42:25,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:42:25,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:42:25,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:42:25,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:42:25,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:42:25,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:42:26,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:42:26,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:42:26,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:42:26,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:42:26,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:42:26,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:42:26,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:42:26,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:42:26,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:42:26,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:42:26,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:42:26,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:42:26,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:42:26,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:42:26,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:42:26,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:42:26,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:42:26,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:42:26,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:42:26,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:42:26,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:42:26,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:42:26,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:42:26,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:42:26,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:42:26,039 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8e332a50-2670-4739-a19a-77437fd37810/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 01:42:26,070 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:42:26,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:42:26,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:42:26,084 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:42:26,084 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:42:26,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:42:26,085 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:42:26,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:42:26,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:42:26,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:42:26,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:42:26,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:42:26,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:42:26,087 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:42:26,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:42:26,088 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:42:26,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:42:26,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:42:26,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:42:26,089 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:42:26,089 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:42:26,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:42:26,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:42:26,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:42:26,090 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:42:26,090 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 01:42:26,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 01:42:26,091 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:42:26,091 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_8e332a50-2670-4739-a19a-77437fd37810/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 -> 14021e9fff9123a734a262a9d34c71e4922bd817 [2019-11-20 01:42:26,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:42:26,305 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:42:26,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:42:26,310 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:42:26,311 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:42:26,312 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8e332a50-2670-4739-a19a-77437fd37810/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label02.c [2019-11-20 01:42:26,374 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e332a50-2670-4739-a19a-77437fd37810/bin/uautomizer/data/b61c4fe40/abaddc0fa0a548e8b18a44deded15385/FLAG6be603ed9 [2019-11-20 01:42:27,047 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:42:27,048 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8e332a50-2670-4739-a19a-77437fd37810/sv-benchmarks/c/eca-rers2012/Problem03_label02.c [2019-11-20 01:42:27,070 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e332a50-2670-4739-a19a-77437fd37810/bin/uautomizer/data/b61c4fe40/abaddc0fa0a548e8b18a44deded15385/FLAG6be603ed9 [2019-11-20 01:42:27,219 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8e332a50-2670-4739-a19a-77437fd37810/bin/uautomizer/data/b61c4fe40/abaddc0fa0a548e8b18a44deded15385 [2019-11-20 01:42:27,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:42:27,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:42:27,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:42:27,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:42:27,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:42:27,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:42:27" (1/1) ... [2019-11-20 01:42:27,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13b0ecf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:42:27, skipping insertion in model container [2019-11-20 01:42:27,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:42:27" (1/1) ... [2019-11-20 01:42:27,251 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:42:27,345 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:42:28,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:42:28,200 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:42:28,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:42:28,535 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:42:28,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:42:28 WrapperNode [2019-11-20 01:42:28,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:42:28,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:42:28,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:42:28,538 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:42:28,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:42:28" (1/1) ... [2019-11-20 01:42:28,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:42:28" (1/1) ... [2019-11-20 01:42:28,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:42:28,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:42:28,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:42:28,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:42:28,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:42:28" (1/1) ... [2019-11-20 01:42:28,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:42:28" (1/1) ... [2019-11-20 01:42:28,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:42:28" (1/1) ... [2019-11-20 01:42:28,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:42:28" (1/1) ... [2019-11-20 01:42:28,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:42:28" (1/1) ... [2019-11-20 01:42:28,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:42:28" (1/1) ... [2019-11-20 01:42:28,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:42:28" (1/1) ... [2019-11-20 01:42:28,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:42:28,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:42:28,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:42:28,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:42:28,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:42:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e332a50-2670-4739-a19a-77437fd37810/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-11-20 01:42:28,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:42:28,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:42:31,509 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:42:31,509 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 01:42:31,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:42:31 BoogieIcfgContainer [2019-11-20 01:42:31,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:42:31,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:42:31,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:42:31,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:42:31,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:42:27" (1/3) ... [2019-11-20 01:42:31,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44478912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:42:31, skipping insertion in model container [2019-11-20 01:42:31,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:42:28" (2/3) ... [2019-11-20 01:42:31,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44478912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:42:31, skipping insertion in model container [2019-11-20 01:42:31,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:42:31" (3/3) ... [2019-11-20 01:42:31,526 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label02.c [2019-11-20 01:42:31,537 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:42:31,550 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 01:42:31,563 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 01:42:31,612 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:42:31,612 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:42:31,612 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:42:31,612 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:42:31,612 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:42:31,612 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:42:31,613 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:42:31,613 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:42:31,649 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-20 01:42:31,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-20 01:42:31,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:42:31,685 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 01:42:31,686 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:42:31,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:42:31,694 INFO L82 PathProgramCache]: Analyzing trace with hash -635106638, now seen corresponding path program 1 times [2019-11-20 01:42:31,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:42:31,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526320463] [2019-11-20 01:42:31,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:42:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:42:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:42:32,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526320463] [2019-11-20 01:42:32,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:42:32,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:42:32,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005914780] [2019-11-20 01:42:32,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:42:32,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:42:32,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:42:32,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:42:32,690 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-20 01:42:35,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:42:35,385 INFO L93 Difference]: Finished difference Result 1075 states and 1929 transitions. [2019-11-20 01:42:35,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:42:35,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-11-20 01:42:35,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:42:35,426 INFO L225 Difference]: With dead ends: 1075 [2019-11-20 01:42:35,427 INFO L226 Difference]: Without dead ends: 677 [2019-11-20 01:42:35,439 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-11-20 01:42:35,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-11-20 01:42:35,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 451. [2019-11-20 01:42:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-11-20 01:42:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 700 transitions. [2019-11-20 01:42:35,558 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 700 transitions. Word has length 204 [2019-11-20 01:42:35,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:42:35,560 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 700 transitions. [2019-11-20 01:42:35,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:42:35,560 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 700 transitions. [2019-11-20 01:42:35,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-20 01:42:35,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:42:35,566 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 01:42:35,567 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:42:35,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:42:35,568 INFO L82 PathProgramCache]: Analyzing trace with hash 317780433, now seen corresponding path program 1 times [2019-11-20 01:42:35,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:42:35,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609900256] [2019-11-20 01:42:35,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:42:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:42:35,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:42:35,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609900256] [2019-11-20 01:42:35,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:42:35,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:42:35,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501180327] [2019-11-20 01:42:35,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:42:35,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:42:35,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:42:35,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:42:35,779 INFO L87 Difference]: Start difference. First operand 451 states and 700 transitions. Second operand 3 states. [2019-11-20 01:42:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:42:36,932 INFO L93 Difference]: Finished difference Result 1323 states and 2069 transitions. [2019-11-20 01:42:36,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:42:36,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-11-20 01:42:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:42:36,939 INFO L225 Difference]: With dead ends: 1323 [2019-11-20 01:42:36,939 INFO L226 Difference]: Without dead ends: 874 [2019-11-20 01:42:36,941 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-11-20 01:42:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-11-20 01:42:36,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 859. [2019-11-20 01:42:36,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-20 01:42:36,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1315 transitions. [2019-11-20 01:42:36,980 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1315 transitions. Word has length 212 [2019-11-20 01:42:36,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:42:36,981 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1315 transitions. [2019-11-20 01:42:36,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:42:36,981 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1315 transitions. [2019-11-20 01:42:36,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 01:42:36,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:42:36,991 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 01:42:36,991 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:42:36,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:42:36,992 INFO L82 PathProgramCache]: Analyzing trace with hash 395983086, now seen corresponding path program 1 times [2019-11-20 01:42:36,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:42:36,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577196449] [2019-11-20 01:42:36,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:42:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:42:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:42:37,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577196449] [2019-11-20 01:42:37,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:42:37,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:42:37,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310342994] [2019-11-20 01:42:37,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:42:37,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:42:37,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:42:37,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:42:37,108 INFO L87 Difference]: Start difference. First operand 859 states and 1315 transitions. Second operand 3 states. [2019-11-20 01:42:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:42:37,699 INFO L93 Difference]: Finished difference Result 1695 states and 2599 transitions. [2019-11-20 01:42:37,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:42:37,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-20 01:42:37,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:42:37,707 INFO L225 Difference]: With dead ends: 1695 [2019-11-20 01:42:37,707 INFO L226 Difference]: Without dead ends: 838 [2019-11-20 01:42:37,709 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-11-20 01:42:37,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-11-20 01:42:37,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-11-20 01:42:37,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-20 01:42:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1236 transitions. [2019-11-20 01:42:37,736 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1236 transitions. Word has length 217 [2019-11-20 01:42:37,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:42:37,737 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1236 transitions. [2019-11-20 01:42:37,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:42:37,737 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1236 transitions. [2019-11-20 01:42:37,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-20 01:42:37,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:42:37,742 INFO L410 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 01:42:37,743 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:42:37,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:42:37,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1769273276, now seen corresponding path program 1 times [2019-11-20 01:42:37,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:42:37,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604315050] [2019-11-20 01:42:37,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:42:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:42:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:42:37,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604315050] [2019-11-20 01:42:37,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:42:37,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:42:37,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775900027] [2019-11-20 01:42:37,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:42:37,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:42:37,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:42:37,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:42:37,967 INFO L87 Difference]: Start difference. First operand 838 states and 1236 transitions. Second operand 4 states. [2019-11-20 01:42:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:42:39,884 INFO L93 Difference]: Finished difference Result 3311 states and 4893 transitions. [2019-11-20 01:42:39,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:42:39,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-11-20 01:42:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:42:39,915 INFO L225 Difference]: With dead ends: 3311 [2019-11-20 01:42:39,915 INFO L226 Difference]: Without dead ends: 2475 [2019-11-20 01:42:39,918 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-11-20 01:42:39,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2019-11-20 01:42:39,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 1655. [2019-11-20 01:42:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2019-11-20 01:42:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2336 transitions. [2019-11-20 01:42:39,983 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2336 transitions. Word has length 218 [2019-11-20 01:42:39,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:42:39,983 INFO L462 AbstractCegarLoop]: Abstraction has 1655 states and 2336 transitions. [2019-11-20 01:42:39,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:42:39,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2336 transitions. [2019-11-20 01:42:39,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-20 01:42:39,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:42:39,992 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 01:42:39,992 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:42:39,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:42:39,993 INFO L82 PathProgramCache]: Analyzing trace with hash -73934984, now seen corresponding path program 1 times [2019-11-20 01:42:39,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:42:39,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383866234] [2019-11-20 01:42:39,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:42:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:42:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 01:42:40,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383866234] [2019-11-20 01:42:40,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:42:40,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:42:40,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787232159] [2019-11-20 01:42:40,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:42:40,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:42:40,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:42:40,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:42:40,125 INFO L87 Difference]: Start difference. First operand 1655 states and 2336 transitions. Second operand 3 states. [2019-11-20 01:42:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:42:40,723 INFO L93 Difference]: Finished difference Result 4955 states and 6996 transitions. [2019-11-20 01:42:40,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:42:40,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-11-20 01:42:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:42:40,748 INFO L225 Difference]: With dead ends: 4955 [2019-11-20 01:42:40,748 INFO L226 Difference]: Without dead ends: 3302 [2019-11-20 01:42:40,751 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-11-20 01:42:40,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2019-11-20 01:42:40,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 3300. [2019-11-20 01:42:40,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3300 states. [2019-11-20 01:42:40,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 4655 transitions. [2019-11-20 01:42:40,857 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 4655 transitions. Word has length 224 [2019-11-20 01:42:40,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:42:40,858 INFO L462 AbstractCegarLoop]: Abstraction has 3300 states and 4655 transitions. [2019-11-20 01:42:40,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:42:40,859 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 4655 transitions. [2019-11-20 01:42:40,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-11-20 01:42:40,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:42:40,868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 01:42:40,869 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:42:40,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:42:40,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1732733814, now seen corresponding path program 1 times [2019-11-20 01:42:40,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:42:40,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703217857] [2019-11-20 01:42:40,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:42:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:42:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:42:41,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703217857] [2019-11-20 01:42:41,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:42:41,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:42:41,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900560758] [2019-11-20 01:42:41,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:42:41,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:42:41,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:42:41,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:42:41,102 INFO L87 Difference]: Start difference. First operand 3300 states and 4655 transitions. Second operand 5 states. [2019-11-20 01:42:43,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:42:43,433 INFO L93 Difference]: Finished difference Result 7633 states and 10834 transitions. [2019-11-20 01:42:43,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:42:43,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 242 [2019-11-20 01:42:43,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:42:43,575 INFO L225 Difference]: With dead ends: 7633 [2019-11-20 01:42:43,575 INFO L226 Difference]: Without dead ends: 4335 [2019-11-20 01:42:43,580 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-11-20 01:42:43,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4335 states. [2019-11-20 01:42:43,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4335 to 3503. [2019-11-20 01:42:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3503 states. [2019-11-20 01:42:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 4897 transitions. [2019-11-20 01:42:43,686 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 4897 transitions. Word has length 242 [2019-11-20 01:42:43,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:42:43,687 INFO L462 AbstractCegarLoop]: Abstraction has 3503 states and 4897 transitions. [2019-11-20 01:42:43,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:42:43,687 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 4897 transitions. [2019-11-20 01:42:43,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-20 01:42:43,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:42:43,699 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 01:42:43,699 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:42:43,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:42:43,705 INFO L82 PathProgramCache]: Analyzing trace with hash -177417023, now seen corresponding path program 1 times [2019-11-20 01:42:43,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:42:43,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737340583] [2019-11-20 01:42:43,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:42:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:42:43,896 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:42:43,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737340583] [2019-11-20 01:42:43,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:42:43,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:42:43,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197484257] [2019-11-20 01:42:43,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:42:43,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:42:43,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:42:43,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:42:43,911 INFO L87 Difference]: Start difference. First operand 3503 states and 4897 transitions. Second operand 3 states. [2019-11-20 01:42:44,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:42:44,840 INFO L93 Difference]: Finished difference Result 8651 states and 12071 transitions. [2019-11-20 01:42:44,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:42:44,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-11-20 01:42:44,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:42:44,877 INFO L225 Difference]: With dead ends: 8651 [2019-11-20 01:42:44,878 INFO L226 Difference]: Without dead ends: 5150 [2019-11-20 01:42:44,883 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-11-20 01:42:44,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5150 states. [2019-11-20 01:42:45,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5150 to 5148. [2019-11-20 01:42:45,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5148 states. [2019-11-20 01:42:45,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 7124 transitions. [2019-11-20 01:42:45,016 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 7124 transitions. Word has length 245 [2019-11-20 01:42:45,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:42:45,016 INFO L462 AbstractCegarLoop]: Abstraction has 5148 states and 7124 transitions. [2019-11-20 01:42:45,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:42:45,017 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 7124 transitions. [2019-11-20 01:42:45,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-20 01:42:45,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:42:45,032 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 01:42:45,032 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:42:45,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:42:45,032 INFO L82 PathProgramCache]: Analyzing trace with hash -285299978, now seen corresponding path program 1 times [2019-11-20 01:42:45,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:42:45,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105843430] [2019-11-20 01:42:45,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:42:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:42:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:42:45,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105843430] [2019-11-20 01:42:45,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031493215] [2019-11-20 01:42:45,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e332a50-2670-4739-a19a-77437fd37810/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-11-20 01:42:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:42:45,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:42:45,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:42:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 01:42:45,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:42:45,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-20 01:42:45,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755409516] [2019-11-20 01:42:45,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:42:45,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:42:45,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:42:45,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:42:45,746 INFO L87 Difference]: Start difference. First operand 5148 states and 7124 transitions. Second operand 3 states. [2019-11-20 01:42:47,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:42:47,106 INFO L93 Difference]: Finished difference Result 14966 states and 20735 transitions. [2019-11-20 01:42:47,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:42:47,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-20 01:42:47,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:42:47,192 INFO L225 Difference]: With dead ends: 14966 [2019-11-20 01:42:47,193 INFO L226 Difference]: Without dead ends: 9820 [2019-11-20 01:42:47,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:42:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9820 states. [2019-11-20 01:42:47,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9820 to 9817. [2019-11-20 01:42:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9817 states. [2019-11-20 01:42:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9817 states to 9817 states and 13584 transitions. [2019-11-20 01:42:47,480 INFO L78 Accepts]: Start accepts. Automaton has 9817 states and 13584 transitions. Word has length 252 [2019-11-20 01:42:47,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:42:47,481 INFO L462 AbstractCegarLoop]: Abstraction has 9817 states and 13584 transitions. [2019-11-20 01:42:47,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:42:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 9817 states and 13584 transitions. [2019-11-20 01:42:47,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-11-20 01:42:47,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:42:47,509 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 01:42:47,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:42:47,725 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:42:47,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:42:47,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1508910405, now seen corresponding path program 1 times [2019-11-20 01:42:47,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:42:47,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369842319] [2019-11-20 01:42:47,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:42:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:42:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-11-20 01:42:47,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369842319] [2019-11-20 01:42:47,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:42:47,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:42:47,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66559062] [2019-11-20 01:42:47,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:42:47,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:42:47,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:42:47,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:42:47,885 INFO L87 Difference]: Start difference. First operand 9817 states and 13584 transitions. Second operand 3 states. [2019-11-20 01:42:49,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:42:49,178 INFO L93 Difference]: Finished difference Result 27349 states and 37743 transitions. [2019-11-20 01:42:49,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:42:49,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2019-11-20 01:42:49,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:42:49,218 INFO L225 Difference]: With dead ends: 27349 [2019-11-20 01:42:49,218 INFO L226 Difference]: Without dead ends: 17534 [2019-11-20 01:42:49,236 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-11-20 01:42:49,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17534 states. [2019-11-20 01:42:49,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17534 to 17532. [2019-11-20 01:42:49,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17532 states. [2019-11-20 01:42:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17532 states to 17532 states and 22681 transitions. [2019-11-20 01:42:49,680 INFO L78 Accepts]: Start accepts. Automaton has 17532 states and 22681 transitions. Word has length 279 [2019-11-20 01:42:49,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:42:49,680 INFO L462 AbstractCegarLoop]: Abstraction has 17532 states and 22681 transitions. [2019-11-20 01:42:49,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:42:49,681 INFO L276 IsEmpty]: Start isEmpty. Operand 17532 states and 22681 transitions. [2019-11-20 01:42:49,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-20 01:42:49,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:42:49,715 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 01:42:49,716 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:42:49,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:42:49,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1279960778, now seen corresponding path program 1 times [2019-11-20 01:42:49,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:42:49,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842840331] [2019-11-20 01:42:49,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:42:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:42:49,877 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-11-20 01:42:49,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842840331] [2019-11-20 01:42:49,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:42:49,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:42:49,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618565117] [2019-11-20 01:42:49,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:42:49,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:42:49,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:42:49,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:42:49,883 INFO L87 Difference]: Start difference. First operand 17532 states and 22681 transitions. Second operand 3 states. [2019-11-20 01:42:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:42:51,052 INFO L93 Difference]: Finished difference Result 35066 states and 45367 transitions. [2019-11-20 01:42:51,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:42:51,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2019-11-20 01:42:51,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:42:51,085 INFO L225 Difference]: With dead ends: 35066 [2019-11-20 01:42:51,085 INFO L226 Difference]: Without dead ends: 17536 [2019-11-20 01:42:51,110 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-11-20 01:42:51,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17536 states. [2019-11-20 01:42:51,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17536 to 17532. [2019-11-20 01:42:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17532 states. [2019-11-20 01:42:51,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17532 states to 17532 states and 20680 transitions. [2019-11-20 01:42:51,379 INFO L78 Accepts]: Start accepts. Automaton has 17532 states and 20680 transitions. Word has length 281 [2019-11-20 01:42:51,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:42:51,379 INFO L462 AbstractCegarLoop]: Abstraction has 17532 states and 20680 transitions. [2019-11-20 01:42:51,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:42:51,380 INFO L276 IsEmpty]: Start isEmpty. Operand 17532 states and 20680 transitions. [2019-11-20 01:42:51,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-11-20 01:42:51,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:42:51,418 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 01:42:51,418 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:42:51,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:42:51,418 INFO L82 PathProgramCache]: Analyzing trace with hash 166387689, now seen corresponding path program 1 times [2019-11-20 01:42:51,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:42:51,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662510652] [2019-11-20 01:42:51,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:42:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:42:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-20 01:42:51,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662510652] [2019-11-20 01:42:51,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:42:51,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:42:51,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038623556] [2019-11-20 01:42:51,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:42:51,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:42:51,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:42:51,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:42:51,600 INFO L87 Difference]: Start difference. First operand 17532 states and 20680 transitions. Second operand 4 states. [2019-11-20 01:42:52,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:42:52,809 INFO L93 Difference]: Finished difference Result 35064 states and 41362 transitions. [2019-11-20 01:42:52,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:42:52,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 299 [2019-11-20 01:42:52,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:42:52,859 INFO L225 Difference]: With dead ends: 35064 [2019-11-20 01:42:52,860 INFO L226 Difference]: Without dead ends: 17534 [2019-11-20 01:42:52,882 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-11-20 01:42:52,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17534 states. [2019-11-20 01:42:53,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17534 to 17532. [2019-11-20 01:42:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17532 states. [2019-11-20 01:42:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17532 states to 17532 states and 20168 transitions. [2019-11-20 01:42:53,176 INFO L78 Accepts]: Start accepts. Automaton has 17532 states and 20168 transitions. Word has length 299 [2019-11-20 01:42:53,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:42:53,177 INFO L462 AbstractCegarLoop]: Abstraction has 17532 states and 20168 transitions. [2019-11-20 01:42:53,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:42:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 17532 states and 20168 transitions. [2019-11-20 01:42:53,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-20 01:42:53,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:42:53,235 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 01:42:53,235 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:42:53,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:42:53,236 INFO L82 PathProgramCache]: Analyzing trace with hash 319416056, now seen corresponding path program 1 times [2019-11-20 01:42:53,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:42:53,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865329578] [2019-11-20 01:42:53,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:42:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:42:53,542 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-20 01:42:53,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865329578] [2019-11-20 01:42:53,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212452767] [2019-11-20 01:42:53,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e332a50-2670-4739-a19a-77437fd37810/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-11-20 01:42:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:42:53,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:42:53,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:42:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 01:42:53,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:42:53,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-20 01:42:53,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205671642] [2019-11-20 01:42:53,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:42:53,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:42:53,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:42:53,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:42:53,884 INFO L87 Difference]: Start difference. First operand 17532 states and 20168 transitions. Second operand 3 states. [2019-11-20 01:42:55,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:42:55,099 INFO L93 Difference]: Finished difference Result 34660 states and 39896 transitions. [2019-11-20 01:42:55,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:42:55,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-20 01:42:55,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:42:55,132 INFO L225 Difference]: With dead ends: 34660 [2019-11-20 01:42:55,132 INFO L226 Difference]: Without dead ends: 17130 [2019-11-20 01:42:55,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:42:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17130 states. [2019-11-20 01:42:55,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17130 to 16314. [2019-11-20 01:42:55,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16314 states. [2019-11-20 01:42:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16314 states to 16314 states and 18372 transitions. [2019-11-20 01:42:55,579 INFO L78 Accepts]: Start accepts. Automaton has 16314 states and 18372 transitions. Word has length 305 [2019-11-20 01:42:55,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:42:55,580 INFO L462 AbstractCegarLoop]: Abstraction has 16314 states and 18372 transitions. [2019-11-20 01:42:55,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:42:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 16314 states and 18372 transitions. [2019-11-20 01:42:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-11-20 01:42:55,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:42:55,607 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:42:55,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:42:55,813 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:42:55,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:42:55,813 INFO L82 PathProgramCache]: Analyzing trace with hash 319777275, now seen corresponding path program 1 times [2019-11-20 01:42:55,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:42:55,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596482152] [2019-11-20 01:42:55,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:42:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:42:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 142 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-20 01:42:56,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596482152] [2019-11-20 01:42:56,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521199180] [2019-11-20 01:42:56,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e332a50-2670-4739-a19a-77437fd37810/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:42:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:42:56,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:42:56,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:42:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-20 01:42:56,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:42:56,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-11-20 01:42:56,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822921403] [2019-11-20 01:42:56,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:42:56,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:42:56,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:42:56,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:42:56,472 INFO L87 Difference]: Start difference. First operand 16314 states and 18372 transitions. Second operand 3 states. [2019-11-20 01:42:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:42:57,092 INFO L93 Difference]: Finished difference Result 47676 states and 53654 transitions. [2019-11-20 01:42:57,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:42:57,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-11-20 01:42:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:42:57,133 INFO L225 Difference]: With dead ends: 47676 [2019-11-20 01:42:57,133 INFO L226 Difference]: Without dead ends: 31364 [2019-11-20 01:42:57,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 333 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:42:57,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31364 states. [2019-11-20 01:42:57,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31364 to 31362. [2019-11-20 01:42:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31362 states. [2019-11-20 01:42:57,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31362 states to 31362 states and 35269 transitions. [2019-11-20 01:42:57,561 INFO L78 Accepts]: Start accepts. Automaton has 31362 states and 35269 transitions. Word has length 334 [2019-11-20 01:42:57,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:42:57,561 INFO L462 AbstractCegarLoop]: Abstraction has 31362 states and 35269 transitions. [2019-11-20 01:42:57,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:42:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 31362 states and 35269 transitions. [2019-11-20 01:42:57,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-11-20 01:42:57,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:42:57,598 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 01:42:57,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:42:57,811 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:42:57,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:42:57,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1227130941, now seen corresponding path program 1 times [2019-11-20 01:42:57,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:42:57,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666247927] [2019-11-20 01:42:57,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:42:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:42:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-20 01:42:58,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666247927] [2019-11-20 01:42:58,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:42:58,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:42:58,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504863096] [2019-11-20 01:42:58,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:42:58,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:42:58,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:42:58,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:42:58,529 INFO L87 Difference]: Start difference. First operand 31362 states and 35269 transitions. Second operand 3 states. [2019-11-20 01:42:59,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:42:59,275 INFO L93 Difference]: Finished difference Result 91421 states and 102843 transitions. [2019-11-20 01:42:59,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:42:59,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 402 [2019-11-20 01:42:59,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:42:59,357 INFO L225 Difference]: With dead ends: 91421 [2019-11-20 01:42:59,357 INFO L226 Difference]: Without dead ends: 60061 [2019-11-20 01:42:59,383 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-11-20 01:42:59,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60061 states. [2019-11-20 01:43:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60061 to 60059. [2019-11-20 01:43:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60059 states. [2019-11-20 01:43:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60059 states to 60059 states and 67560 transitions. [2019-11-20 01:43:00,122 INFO L78 Accepts]: Start accepts. Automaton has 60059 states and 67560 transitions. Word has length 402 [2019-11-20 01:43:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:43:00,123 INFO L462 AbstractCegarLoop]: Abstraction has 60059 states and 67560 transitions. [2019-11-20 01:43:00,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:43:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 60059 states and 67560 transitions. [2019-11-20 01:43:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-11-20 01:43:00,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:43:00,176 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 01:43:00,177 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:43:00,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:43:00,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1835984863, now seen corresponding path program 1 times [2019-11-20 01:43:00,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:43:00,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019680301] [2019-11-20 01:43:00,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:43:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:43:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-20 01:43:00,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019680301] [2019-11-20 01:43:00,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:43:00,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:43:00,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643082408] [2019-11-20 01:43:00,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:43:00,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:43:00,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:43:00,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:43:00,537 INFO L87 Difference]: Start difference. First operand 60059 states and 67560 transitions. Second operand 3 states. [2019-11-20 01:43:01,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:43:01,638 INFO L93 Difference]: Finished difference Result 170158 states and 191231 transitions. [2019-11-20 01:43:01,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:43:01,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 406 [2019-11-20 01:43:01,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:43:01,809 INFO L225 Difference]: With dead ends: 170158 [2019-11-20 01:43:01,809 INFO L226 Difference]: Without dead ends: 110101 [2019-11-20 01:43:01,854 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-11-20 01:43:01,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110101 states. [2019-11-20 01:43:03,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110101 to 110099. [2019-11-20 01:43:03,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110099 states. [2019-11-20 01:43:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110099 states to 110099 states and 123037 transitions. [2019-11-20 01:43:03,160 INFO L78 Accepts]: Start accepts. Automaton has 110099 states and 123037 transitions. Word has length 406 [2019-11-20 01:43:03,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:43:03,160 INFO L462 AbstractCegarLoop]: Abstraction has 110099 states and 123037 transitions. [2019-11-20 01:43:03,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:43:03,161 INFO L276 IsEmpty]: Start isEmpty. Operand 110099 states and 123037 transitions. [2019-11-20 01:43:03,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-11-20 01:43:03,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:43:03,228 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 01:43:03,229 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:43:03,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:43:03,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1939314004, now seen corresponding path program 1 times [2019-11-20 01:43:03,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:43:03,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769256675] [2019-11-20 01:43:03,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:43:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:43:04,230 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 01:43:04,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769256675] [2019-11-20 01:43:04,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:43:04,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:43:04,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54245107] [2019-11-20 01:43:04,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:43:04,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:43:04,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:43:04,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:43:04,233 INFO L87 Difference]: Start difference. First operand 110099 states and 123037 transitions. Second operand 3 states. [2019-11-20 01:43:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:43:05,412 INFO L93 Difference]: Finished difference Result 279372 states and 311596 transitions. [2019-11-20 01:43:05,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:43:05,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 408 [2019-11-20 01:43:05,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:43:05,622 INFO L225 Difference]: With dead ends: 279372 [2019-11-20 01:43:05,622 INFO L226 Difference]: Without dead ends: 169275 [2019-11-20 01:43:05,691 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-11-20 01:43:05,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169275 states. [2019-11-20 01:43:08,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169275 to 169273. [2019-11-20 01:43:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169273 states. [2019-11-20 01:43:08,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169273 states to 169273 states and 188538 transitions. [2019-11-20 01:43:08,225 INFO L78 Accepts]: Start accepts. Automaton has 169273 states and 188538 transitions. Word has length 408 [2019-11-20 01:43:08,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:43:08,226 INFO L462 AbstractCegarLoop]: Abstraction has 169273 states and 188538 transitions. [2019-11-20 01:43:08,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:43:08,226 INFO L276 IsEmpty]: Start isEmpty. Operand 169273 states and 188538 transitions. [2019-11-20 01:43:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-11-20 01:43:08,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:43:08,378 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 01:43:08,378 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:43:08,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:43:08,379 INFO L82 PathProgramCache]: Analyzing trace with hash 20202666, now seen corresponding path program 1 times [2019-11-20 01:43:08,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:43:08,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087180944] [2019-11-20 01:43:08,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:43:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:43:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-11-20 01:43:08,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087180944] [2019-11-20 01:43:08,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:43:08,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:43:08,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631046180] [2019-11-20 01:43:08,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:43:08,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:43:08,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:43:08,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:43:08,628 INFO L87 Difference]: Start difference. First operand 169273 states and 188538 transitions. Second operand 4 states. [2019-11-20 01:43:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:43:11,317 INFO L93 Difference]: Finished difference Result 365751 states and 409365 transitions. [2019-11-20 01:43:11,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:43:11,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 420 [2019-11-20 01:43:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:43:11,528 INFO L225 Difference]: With dead ends: 365751 [2019-11-20 01:43:11,528 INFO L226 Difference]: Without dead ends: 196480 [2019-11-20 01:43:11,604 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-11-20 01:43:11,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196480 states. [2019-11-20 01:43:19,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196480 to 196456. [2019-11-20 01:43:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196456 states. [2019-11-20 01:43:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196456 states to 196456 states and 215216 transitions. [2019-11-20 01:43:19,720 INFO L78 Accepts]: Start accepts. Automaton has 196456 states and 215216 transitions. Word has length 420 [2019-11-20 01:43:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:43:19,721 INFO L462 AbstractCegarLoop]: Abstraction has 196456 states and 215216 transitions. [2019-11-20 01:43:19,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:43:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 196456 states and 215216 transitions. [2019-11-20 01:43:19,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-11-20 01:43:19,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:43:19,800 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 01:43:19,801 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:43:19,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:43:19,801 INFO L82 PathProgramCache]: Analyzing trace with hash -2075258228, now seen corresponding path program 1 times [2019-11-20 01:43:19,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:43:19,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729206560] [2019-11-20 01:43:19,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:43:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:43:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-11-20 01:43:20,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729206560] [2019-11-20 01:43:20,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:43:20,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:43:20,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250993701] [2019-11-20 01:43:20,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:43:20,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:43:20,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:43:20,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:43:20,188 INFO L87 Difference]: Start difference. First operand 196456 states and 215216 transitions. Second operand 3 states. [2019-11-20 01:43:22,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:43:22,651 INFO L93 Difference]: Finished difference Result 390297 states and 427717 transitions. [2019-11-20 01:43:22,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:43:22,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-11-20 01:43:22,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:43:22,867 INFO L225 Difference]: With dead ends: 390297 [2019-11-20 01:43:22,868 INFO L226 Difference]: Without dead ends: 193843 [2019-11-20 01:43:22,943 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-11-20 01:43:23,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193843 states. [2019-11-20 01:43:24,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193843 to 190366. [2019-11-20 01:43:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190366 states. [2019-11-20 01:43:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190366 states to 190366 states and 206912 transitions. [2019-11-20 01:43:25,101 INFO L78 Accepts]: Start accepts. Automaton has 190366 states and 206912 transitions. Word has length 469 [2019-11-20 01:43:25,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:43:25,102 INFO L462 AbstractCegarLoop]: Abstraction has 190366 states and 206912 transitions. [2019-11-20 01:43:25,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:43:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 190366 states and 206912 transitions. [2019-11-20 01:43:25,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2019-11-20 01:43:25,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:43:25,174 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 01:43:25,175 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:43:25,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:43:25,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1215708500, now seen corresponding path program 1 times [2019-11-20 01:43:25,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:43:25,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283923604] [2019-11-20 01:43:25,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:43:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:43:26,821 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-20 01:43:26,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283923604] [2019-11-20 01:43:26,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:43:26,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:43:26,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986614882] [2019-11-20 01:43:26,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:43:26,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:43:26,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:43:26,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:43:26,824 INFO L87 Difference]: Start difference. First operand 190366 states and 206912 transitions. Second operand 3 states. [2019-11-20 01:43:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:43:28,812 INFO L93 Difference]: Finished difference Result 401497 states and 437034 transitions. [2019-11-20 01:43:28,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:43:28,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 484 [2019-11-20 01:43:28,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:43:28,814 INFO L225 Difference]: With dead ends: 401497 [2019-11-20 01:43:28,815 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 01:43:28,919 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-11-20 01:43:28,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 01:43:28,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 01:43:28,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 01:43:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 01:43:28,919 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 484 [2019-11-20 01:43:28,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:43:28,920 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 01:43:28,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:43:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 01:43:28,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 01:43:28,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 01:43:38,305 WARN L191 SmtUtils]: Spent 9.36 s on a formula simplification. DAG size of input: 1075 DAG size of output: 479 [2019-11-20 01:43:45,999 WARN L191 SmtUtils]: Spent 7.69 s on a formula simplification. DAG size of input: 1075 DAG size of output: 479 [2019-11-20 01:43:55,377 WARN L191 SmtUtils]: Spent 9.37 s on a formula simplification. DAG size of input: 474 DAG size of output: 100 [2019-11-20 01:44:03,756 WARN L191 SmtUtils]: Spent 8.37 s on a formula simplification. DAG size of input: 474 DAG size of output: 100 [2019-11-20 01:44:03,759 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-20 01:44:03,759 INFO L444 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-20 01:44:03,759 INFO L444 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,759 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,759 INFO L444 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,759 INFO L444 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,759 INFO L444 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,760 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,760 INFO L444 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,760 INFO L444 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-20 01:44:03,760 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,760 INFO L444 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-20 01:44:03,760 INFO L444 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-20 01:44:03,760 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,760 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,760 INFO L444 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,760 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,760 INFO L444 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-20 01:44:03,760 INFO L444 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-20 01:44:03,761 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,761 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,761 INFO L444 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,761 INFO L444 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,761 INFO L444 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,761 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,761 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,761 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,761 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,761 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,761 INFO L444 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-20 01:44:03,761 INFO L444 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-20 01:44:03,761 INFO L444 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-20 01:44:03,762 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,762 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,762 INFO L444 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,762 INFO L444 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,762 INFO L444 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,762 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,762 INFO L444 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-20 01:44:03,762 INFO L444 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-20 01:44:03,762 INFO L444 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-20 01:44:03,763 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,763 INFO L444 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,763 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,763 INFO L444 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,763 INFO L444 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,763 INFO L444 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,764 INFO L444 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-20 01:44:03,764 INFO L444 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-20 01:44:03,764 INFO L444 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-20 01:44:03,764 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,764 INFO L444 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,764 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,764 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-20 01:44:03,764 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,765 INFO L444 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-20 01:44:03,765 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,765 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,765 INFO L444 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-20 01:44:03,765 INFO L444 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-20 01:44:03,765 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,765 INFO L444 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,765 INFO L444 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,765 INFO L444 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,765 INFO L444 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,765 INFO L444 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,765 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,765 INFO L444 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-20 01:44:03,766 INFO L444 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-20 01:44:03,766 INFO L444 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-20 01:44:03,766 INFO L444 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-20 01:44:03,766 INFO L444 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-20 01:44:03,766 INFO L444 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,766 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,766 INFO L444 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,766 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,766 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,766 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,766 INFO L444 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,766 INFO L444 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,767 INFO L444 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,767 INFO L444 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,767 INFO L444 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-20 01:44:03,767 INFO L444 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-20 01:44:03,767 INFO L444 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-20 01:44:03,767 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,767 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,767 INFO L444 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,767 INFO L444 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,767 INFO L444 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,767 INFO L444 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,767 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,767 INFO L444 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,768 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,768 INFO L444 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-20 01:44:03,768 INFO L444 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-20 01:44:03,768 INFO L444 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-20 01:44:03,768 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-20 01:44:03,768 INFO L444 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-20 01:44:03,768 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,768 INFO L444 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,768 INFO L444 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,768 INFO L444 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,768 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,768 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 01:44:03,768 INFO L444 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,769 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,769 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,769 INFO L444 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-20 01:44:03,769 INFO L444 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-20 01:44:03,769 INFO L444 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-20 01:44:03,769 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,769 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,769 INFO L444 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,769 INFO L444 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-20 01:44:03,769 INFO L444 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-20 01:44:03,769 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,769 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,770 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,770 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-20 01:44:03,770 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,770 INFO L444 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-20 01:44:03,770 INFO L444 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,770 INFO L444 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-20 01:44:03,770 INFO L444 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,770 INFO L444 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,770 INFO L444 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-20 01:44:03,771 INFO L444 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-20 01:44:03,771 INFO L444 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-20 01:44:03,771 INFO L444 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-20 01:44:03,771 INFO L444 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-20 01:44:03,771 INFO L444 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-20 01:44:03,772 INFO L444 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-20 01:44:03,772 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,772 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,772 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,773 INFO L440 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse7 (= 1 ~a6~0)) (.cse2 (= ~a12~0 1))) (let ((.cse1 (= ~a27~0 1)) (.cse13 (not .cse2)) (.cse22 (not .cse7)) (.cse3 (= ~a5~0 1))) (let ((.cse16 (and .cse22 .cse3)) (.cse17 (and .cse13 .cse22 .cse3)) (.cse23 (not .cse1)) (.cse6 (= ~a16~0 1))) (let ((.cse12 (and .cse17 .cse23 .cse6)) (.cse21 (and .cse23 .cse6 .cse16)) (.cse18 (= 1 ~a3~0)) (.cse20 (= 1 ~a8~0)) (.cse8 (and .cse23 .cse3 .cse6)) (.cse11 (= 1 ~a0~0)) (.cse0 (<= ~a3~0 0)) (.cse15 (<= ~a11~0 0)) (.cse10 (= 1 ~a4~0)) (.cse19 (and .cse13 .cse1 .cse22 .cse3)) (.cse14 (<= 1 ~a3~0)) (.cse4 (= ~a11~0 1)) (.cse5 (= ~a26~0 1)) (.cse9 (= ~a15~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse4 .cse5 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse10) (and .cse4 .cse5 .cse11 .cse9 .cse12) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse11) (and .cse14 .cse2 .cse15 .cse5 .cse9 .cse16) (and .cse17 .cse18 .cse15 .cse11) (and .cse17 .cse14 .cse4 .cse11) (and .cse0 .cse13 .cse7 .cse15 .cse3 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse9) (and .cse19 .cse15 .cse11) (and .cse18 .cse7 .cse15 .cse3 .cse11 .cse10) (and .cse1 .cse15 .cse3 .cse11 .cse5 .cse10) (and .cse14 .cse4 .cse9 .cse12) (and .cse14 .cse1 .cse7 .cse15 .cse3 .cse11) (and .cse13 .cse1 .cse18 .cse20 .cse3 .cse4 .cse5) (and .cse2 .cse21 .cse4 .cse5 .cse11 .cse10) (and .cse1 .cse15 .cse3 .cse5 .cse11 .cse9) (and .cse0 .cse19 .cse4 .cse6 .cse10) (and .cse14 .cse4 .cse5 .cse11 .cse16) (and .cse13 .cse7 .cse15 .cse3 .cse11) (and .cse19 .cse4 .cse11) (and .cse19 .cse18 .cse4 .cse6) (and .cse14 .cse1 .cse7 .cse15 .cse3 .cse9 .cse10) (and .cse1 .cse3 .cse4 .cse5 .cse11 .cse6) (and .cse14 .cse2 .cse4 .cse5 .cse9 .cse16 .cse10) (and .cse0 .cse2 .cse15 .cse20 .cse9 .cse16) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse5 .cse6) (and .cse0 .cse2 .cse15 .cse21 .cse11) (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse11 .cse9) (and .cse18 .cse7 .cse2 .cse8 .cse4) (and .cse0 .cse2 .cse20 .cse21 .cse4 .cse5) (and .cse18 .cse2 .cse4 .cse5 .cse16 .cse10) (and .cse13 .cse7 .cse15 .cse3 .cse5) (and .cse14 .cse1 .cse7 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse5 .cse9) (and (and .cse0 .cse13 .cse7 .cse3 .cse4 .cse6) .cse5 .cse10) (and .cse0 .cse13 .cse1 .cse7 .cse3 .cse4) (and .cse0 .cse2 .cse15 .cse16 .cse10) (and .cse14 .cse19 .cse15 .cse5 .cse9) (and .cse0 (and .cse1 .cse22 .cse3) .cse2 .cse15 .cse5) (and .cse0 .cse19 .cse4 .cse9 .cse10) (and .cse18 .cse7 .cse15 .cse3 .cse5 .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse9 .cse10) (and .cse14 .cse2 .cse21 .cse4 .cse5 .cse10) (and .cse17 .cse18 .cse15 .cse5 .cse10) (and .cse1 .cse15 .cse3 .cse5 .cse9 .cse10) (and (and .cse0 .cse13 .cse7 .cse15 .cse3 .cse6) .cse10) (and .cse7 .cse8 .cse15 .cse11 .cse10) (and .cse14 .cse2 .cse15 .cse3 .cse5 .cse11) (and .cse14 .cse1 .cse15 .cse20 .cse3 .cse11) (and .cse0 .cse7 .cse8 .cse15 .cse11) (and .cse13 .cse14 .cse1 .cse7 .cse15 .cse3) (and .cse0 .cse7 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse19 .cse15 .cse10) (and .cse14 .cse2 .cse15 .cse3 .cse5 .cse9 .cse10) (and .cse14 .cse19 .cse4 .cse5) (and .cse13 .cse14 .cse7 .cse3 .cse4 .cse5 .cse9)))))) [2019-11-20 01:44:03,773 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,773 INFO L444 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,773 INFO L444 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,774 INFO L444 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-20 01:44:03,774 INFO L444 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-20 01:44:03,774 INFO L444 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,774 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,774 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 01:44:03,774 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1647) no Hoare annotation was computed. [2019-11-20 01:44:03,775 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,775 INFO L447 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-20 01:44:03,775 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,775 INFO L444 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,775 INFO L444 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,775 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,775 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,775 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,776 INFO L444 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-20 01:44:03,776 INFO L444 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-20 01:44:03,776 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,776 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,776 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,776 INFO L444 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,776 INFO L444 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,776 INFO L444 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,776 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,776 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,777 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,777 INFO L444 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-20 01:44:03,777 INFO L444 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-20 01:44:03,777 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,777 INFO L444 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,777 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-20 01:44:03,778 INFO L444 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-20 01:44:03,778 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,778 INFO L440 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse7 (= 1 ~a6~0)) (.cse2 (= ~a12~0 1))) (let ((.cse1 (= ~a27~0 1)) (.cse13 (not .cse2)) (.cse22 (not .cse7)) (.cse3 (= ~a5~0 1))) (let ((.cse16 (and .cse22 .cse3)) (.cse17 (and .cse13 .cse22 .cse3)) (.cse23 (not .cse1)) (.cse6 (= ~a16~0 1))) (let ((.cse12 (and .cse17 .cse23 .cse6)) (.cse21 (and .cse23 .cse6 .cse16)) (.cse18 (= 1 ~a3~0)) (.cse20 (= 1 ~a8~0)) (.cse8 (and .cse23 .cse3 .cse6)) (.cse11 (= 1 ~a0~0)) (.cse0 (<= ~a3~0 0)) (.cse15 (<= ~a11~0 0)) (.cse10 (= 1 ~a4~0)) (.cse19 (and .cse13 .cse1 .cse22 .cse3)) (.cse14 (<= 1 ~a3~0)) (.cse4 (= ~a11~0 1)) (.cse5 (= ~a26~0 1)) (.cse9 (= ~a15~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse4 .cse5 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse10) (and .cse4 .cse5 .cse11 .cse9 .cse12) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse11) (and .cse14 .cse2 .cse15 .cse5 .cse9 .cse16) (and .cse17 .cse18 .cse15 .cse11) (and .cse17 .cse14 .cse4 .cse11) (and .cse0 .cse13 .cse7 .cse15 .cse3 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse9) (and .cse19 .cse15 .cse11) (and .cse18 .cse7 .cse15 .cse3 .cse11 .cse10) (and .cse1 .cse15 .cse3 .cse11 .cse5 .cse10) (and .cse14 .cse4 .cse9 .cse12) (and .cse14 .cse1 .cse7 .cse15 .cse3 .cse11) (and .cse13 .cse1 .cse18 .cse20 .cse3 .cse4 .cse5) (and .cse2 .cse21 .cse4 .cse5 .cse11 .cse10) (and .cse1 .cse15 .cse3 .cse5 .cse11 .cse9) (and .cse0 .cse19 .cse4 .cse6 .cse10) (and .cse14 .cse4 .cse5 .cse11 .cse16) (and .cse13 .cse7 .cse15 .cse3 .cse11) (and .cse19 .cse4 .cse11) (and .cse19 .cse18 .cse4 .cse6) (and .cse14 .cse1 .cse7 .cse15 .cse3 .cse9 .cse10) (and .cse1 .cse3 .cse4 .cse5 .cse11 .cse6) (and .cse14 .cse2 .cse4 .cse5 .cse9 .cse16 .cse10) (and .cse0 .cse2 .cse15 .cse20 .cse9 .cse16) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse5 .cse6) (and .cse0 .cse2 .cse15 .cse21 .cse11) (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse11 .cse9) (and .cse18 .cse7 .cse2 .cse8 .cse4) (and .cse0 .cse2 .cse20 .cse21 .cse4 .cse5) (and .cse18 .cse2 .cse4 .cse5 .cse16 .cse10) (and .cse13 .cse7 .cse15 .cse3 .cse5) (and .cse14 .cse1 .cse7 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse5 .cse9) (and (and .cse0 .cse13 .cse7 .cse3 .cse4 .cse6) .cse5 .cse10) (and .cse0 .cse13 .cse1 .cse7 .cse3 .cse4) (and .cse0 .cse2 .cse15 .cse16 .cse10) (and .cse14 .cse19 .cse15 .cse5 .cse9) (and .cse0 (and .cse1 .cse22 .cse3) .cse2 .cse15 .cse5) (and .cse0 .cse19 .cse4 .cse9 .cse10) (and .cse18 .cse7 .cse15 .cse3 .cse5 .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse9 .cse10) (and .cse14 .cse2 .cse21 .cse4 .cse5 .cse10) (and .cse17 .cse18 .cse15 .cse5 .cse10) (and .cse1 .cse15 .cse3 .cse5 .cse9 .cse10) (and (and .cse0 .cse13 .cse7 .cse15 .cse3 .cse6) .cse10) (and .cse7 .cse8 .cse15 .cse11 .cse10) (and .cse14 .cse2 .cse15 .cse3 .cse5 .cse11) (and .cse14 .cse1 .cse15 .cse20 .cse3 .cse11) (and .cse0 .cse7 .cse8 .cse15 .cse11) (and .cse13 .cse14 .cse1 .cse7 .cse15 .cse3) (and .cse0 .cse7 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse19 .cse15 .cse10) (and .cse14 .cse2 .cse15 .cse3 .cse5 .cse9 .cse10) (and .cse14 .cse19 .cse4 .cse5) (and .cse13 .cse14 .cse7 .cse3 .cse4 .cse5 .cse9)))))) [2019-11-20 01:44:03,778 INFO L444 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,779 INFO L444 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,779 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,779 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,779 INFO L444 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-20 01:44:03,779 INFO L444 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-20 01:44:03,779 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,779 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,779 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,779 INFO L444 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,779 INFO L444 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,779 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,779 INFO L444 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,780 INFO L444 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,780 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-20 01:44:03,780 INFO L444 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-20 01:44:03,780 INFO L444 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-20 01:44:03,780 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,780 INFO L444 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-20 01:44:03,780 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,780 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,780 INFO L444 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-20 01:44:03,780 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,780 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,780 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,780 INFO L444 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,781 INFO L444 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,781 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-20 01:44:03,781 INFO L444 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,781 INFO L444 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-20 01:44:03,781 INFO L444 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-20 01:44:03,781 INFO L444 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-20 01:44:03,781 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,781 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,781 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,781 INFO L444 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,781 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,781 INFO L444 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,782 INFO L444 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,782 INFO L444 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,782 INFO L444 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-20 01:44:03,782 INFO L444 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-20 01:44:03,782 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,782 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,782 INFO L444 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-20 01:44:03,782 INFO L444 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-20 01:44:03,782 INFO L444 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-20 01:44:03,782 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,782 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,782 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,782 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,783 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,783 INFO L444 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,783 INFO L444 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,783 INFO L444 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,783 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,783 INFO L444 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,783 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,783 INFO L444 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-20 01:44:03,783 INFO L444 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-20 01:44:03,783 INFO L444 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-20 01:44:03,784 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 01:44:03,784 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,784 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,784 INFO L444 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,784 INFO L444 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,784 INFO L444 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,785 INFO L444 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,785 INFO L444 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,785 INFO L444 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-20 01:44:03,785 INFO L444 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-20 01:44:03,785 INFO L444 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,785 INFO L444 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-20 01:44:03,786 INFO L444 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-20 01:44:03,786 INFO L444 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-20 01:44:03,786 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,786 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,786 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,787 INFO L444 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,787 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,787 INFO L444 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-20 01:44:03,787 INFO L444 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-20 01:44:03,787 INFO L444 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,787 INFO L444 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,788 INFO L444 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,788 INFO L444 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-20 01:44:03,788 INFO L444 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-20 01:44:03,788 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,788 INFO L444 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-20 01:44:03,788 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,789 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,789 INFO L444 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,789 INFO L444 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,789 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,789 INFO L444 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,789 INFO L444 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,790 INFO L444 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,790 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,790 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,790 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 01:44:03,790 INFO L444 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-20 01:44:03,791 INFO L444 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-20 01:44:03,791 INFO L444 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-20 01:44:03,791 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,791 INFO L444 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-20 01:44:03,791 INFO L444 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-20 01:44:03,791 INFO L444 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,792 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,792 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,792 INFO L444 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,792 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,792 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,792 INFO L444 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,792 INFO L444 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,792 INFO L444 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,792 INFO L444 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-20 01:44:03,792 INFO L444 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-20 01:44:03,793 INFO L444 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-20 01:44:03,793 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,793 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,793 INFO L444 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,793 INFO L444 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,793 INFO L444 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 01:44:03,793 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,793 INFO L444 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-20 01:44:03,793 INFO L444 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-20 01:44:03,793 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,793 INFO L444 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-20 01:44:03,793 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-20 01:44:03,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:44:03 BoogieIcfgContainer [2019-11-20 01:44:03,872 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 01:44:03,872 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 01:44:03,873 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 01:44:03,873 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 01:44:03,873 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:42:31" (3/4) ... [2019-11-20 01:44:03,877 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 01:44:03,914 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 01:44:03,918 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 01:44:04,187 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8e332a50-2670-4739-a19a-77437fd37810/bin/uautomizer/witness.graphml [2019-11-20 01:44:04,188 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 01:44:04,189 INFO L168 Benchmark]: Toolchain (without parser) took 96965.37 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.4 GB). Free memory was 944.8 MB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-11-20 01:44:04,190 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:44:04,190 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1302.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2019-11-20 01:44:04,191 INFO L168 Benchmark]: Boogie Procedure Inliner took 176.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:44:04,191 INFO L168 Benchmark]: Boogie Preprocessor took 118.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 01:44:04,192 INFO L168 Benchmark]: RCFGBuilder took 2678.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.1 MB). Peak memory consumption was 189.7 MB. Max. memory is 11.5 GB. [2019-11-20 01:44:04,192 INFO L168 Benchmark]: TraceAbstraction took 92359.86 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. [2019-11-20 01:44:04,193 INFO L168 Benchmark]: Witness Printer took 315.48 ms. Allocated memory is still 5.4 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 82.5 MB). Peak memory consumption was 82.5 MB. Max. memory is 11.5 GB. [2019-11-20 01:44:04,195 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1302.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 176.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 118.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2678.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.1 MB). Peak memory consumption was 189.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 92359.86 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. * Witness Printer took 315.48 ms. Allocated memory is still 5.4 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 82.5 MB). Peak memory consumption was 82.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1647]: 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: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((a3 <= 0 && a27 == 1) && a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) || ((((((a3 <= 0 && 1 == a6) && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 == 1) && a26 == 1) && a15 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && a5 == 1) && a11 == 1) && 1 == a0) && a26 == 1) && 1 == a4)) || ((((a11 == 1 && a26 == 1) && 1 == a0) && a15 == 1) && (((!(a12 == 1) && !(1 == a6)) && a5 == 1) && !(a27 == 1)) && a16 == 1)) || (((((!(a12 == 1) && 1 <= a3) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) || (((((1 <= a3 && a12 == 1) && a11 <= 0) && a26 == 1) && a15 == 1) && !(1 == a6) && a5 == 1)) || (((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 == a3) && a11 <= 0) && 1 == a0)) || (((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 <= a3) && a11 == 1) && 1 == a0)) || ((((((a3 <= 0 && !(a12 == 1)) && 1 == a6) && a11 <= 0) && a5 == 1) && a15 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) && a15 == 1)) || (((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 <= 0) && 1 == a0)) || (((((1 == a3 && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0) && 1 == a4)) || (((((a27 == 1 && a11 <= 0) && a5 == 1) && 1 == a0) && a26 == 1) && 1 == a4)) || (((1 <= a3 && a11 == 1) && a15 == 1) && (((!(a12 == 1) && !(1 == a6)) && a5 == 1) && !(a27 == 1)) && a16 == 1)) || (((((1 <= a3 && a27 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((((!(a12 == 1) && a27 == 1) && 1 == a3) && 1 == a8) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((a12 == 1 && (!(a27 == 1) && a16 == 1) && !(1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && 1 == a4)) || (((((a27 == 1 && a11 <= 0) && a5 == 1) && a26 == 1) && 1 == a0) && a15 == 1)) || ((((a3 <= 0 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((1 <= a3 && a11 == 1) && a26 == 1) && 1 == a0) && !(1 == a6) && a5 == 1)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0)) || (((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && 1 == a0)) || ((((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && 1 == a3) && a11 == 1) && a16 == 1)) || ((((((1 <= a3 && a27 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && a15 == 1) && 1 == a4)) || (((((a27 == 1 && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || ((((((1 <= a3 && a12 == 1) && a11 == 1) && a26 == 1) && a15 == 1) && !(1 == a6) && a5 == 1) && 1 == a4)) || (((((a3 <= 0 && a12 == 1) && a11 <= 0) && 1 == a8) && a15 == 1) && !(1 == a6) && a5 == 1)) || ((((((a3 <= 0 && a27 == 1) && a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((a3 <= 0 && a12 == 1) && a11 <= 0) && (!(a27 == 1) && a16 == 1) && !(1 == a6) && a5 == 1) && 1 == a0)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && 1 == a0) && a15 == 1)) || ((((1 == a3 && 1 == a6) && a12 == 1) && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 == 1)) || (((((a3 <= 0 && a12 == 1) && 1 == a8) && (!(a27 == 1) && a16 == 1) && !(1 == a6) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((1 == a3 && a12 == 1) && a11 == 1) && a26 == 1) && !(1 == a6) && a5 == 1) && 1 == a4)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && a26 == 1)) || (((((((1 <= a3 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && a15 == 1)) || (((((((a3 <= 0 && !(a12 == 1)) && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1) && a26 == 1) && 1 == a4)) || (((((a3 <= 0 && !(a12 == 1)) && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1)) || ((((a3 <= 0 && a12 == 1) && a11 <= 0) && !(1 == a6) && a5 == 1) && 1 == a4)) || ((((1 <= a3 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 <= 0) && a26 == 1) && a15 == 1)) || ((((a3 <= 0 && (a27 == 1 && !(1 == a6)) && a5 == 1) && a12 == 1) && a11 <= 0) && a26 == 1)) || ((((a3 <= 0 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a15 == 1) && 1 == a4)) || (((((1 == a3 && 1 == a6) && a11 <= 0) && a5 == 1) && a26 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a15 == 1) && 1 == a4)) || (((((1 <= a3 && a12 == 1) && (!(a27 == 1) && a16 == 1) && !(1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a4)) || ((((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 == a3) && a11 <= 0) && a26 == 1) && 1 == a4)) || (((((a27 == 1 && a11 <= 0) && a5 == 1) && a26 == 1) && a15 == 1) && 1 == a4)) || ((((((a3 <= 0 && !(a12 == 1)) && 1 == a6) && a11 <= 0) && a5 == 1) && a16 == 1) && 1 == a4)) || ((((1 == a6 && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 <= 0) && 1 == a0) && 1 == a4)) || (((((1 <= a3 && a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && 1 == a0)) || (((((1 <= a3 && a27 == 1) && a11 <= 0) && 1 == a8) && a5 == 1) && 1 == a0)) || ((((a3 <= 0 && 1 == a6) && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 <= 0) && 1 == a0)) || (((((!(a12 == 1) && 1 <= a3) && a27 == 1) && 1 == a6) && a11 <= 0) && a5 == 1)) || (((((a3 <= 0 && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) || (((a3 <= 0 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 <= 0) && 1 == a4)) || ((((((1 <= a3 && a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && a15 == 1) && 1 == a4)) || (((1 <= a3 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((((!(a12 == 1) && 1 <= a3) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && a15 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((a3 <= 0 && a27 == 1) && a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) || ((((((a3 <= 0 && 1 == a6) && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 == 1) && a26 == 1) && a15 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && a5 == 1) && a11 == 1) && 1 == a0) && a26 == 1) && 1 == a4)) || ((((a11 == 1 && a26 == 1) && 1 == a0) && a15 == 1) && (((!(a12 == 1) && !(1 == a6)) && a5 == 1) && !(a27 == 1)) && a16 == 1)) || (((((!(a12 == 1) && 1 <= a3) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) || (((((1 <= a3 && a12 == 1) && a11 <= 0) && a26 == 1) && a15 == 1) && !(1 == a6) && a5 == 1)) || (((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 == a3) && a11 <= 0) && 1 == a0)) || (((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 <= a3) && a11 == 1) && 1 == a0)) || ((((((a3 <= 0 && !(a12 == 1)) && 1 == a6) && a11 <= 0) && a5 == 1) && a15 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) && a15 == 1)) || (((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 <= 0) && 1 == a0)) || (((((1 == a3 && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0) && 1 == a4)) || (((((a27 == 1 && a11 <= 0) && a5 == 1) && 1 == a0) && a26 == 1) && 1 == a4)) || (((1 <= a3 && a11 == 1) && a15 == 1) && (((!(a12 == 1) && !(1 == a6)) && a5 == 1) && !(a27 == 1)) && a16 == 1)) || (((((1 <= a3 && a27 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((((!(a12 == 1) && a27 == 1) && 1 == a3) && 1 == a8) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((a12 == 1 && (!(a27 == 1) && a16 == 1) && !(1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && 1 == a4)) || (((((a27 == 1 && a11 <= 0) && a5 == 1) && a26 == 1) && 1 == a0) && a15 == 1)) || ((((a3 <= 0 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((1 <= a3 && a11 == 1) && a26 == 1) && 1 == a0) && !(1 == a6) && a5 == 1)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0)) || (((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && 1 == a0)) || ((((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && 1 == a3) && a11 == 1) && a16 == 1)) || ((((((1 <= a3 && a27 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && a15 == 1) && 1 == a4)) || (((((a27 == 1 && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || ((((((1 <= a3 && a12 == 1) && a11 == 1) && a26 == 1) && a15 == 1) && !(1 == a6) && a5 == 1) && 1 == a4)) || (((((a3 <= 0 && a12 == 1) && a11 <= 0) && 1 == a8) && a15 == 1) && !(1 == a6) && a5 == 1)) || ((((((a3 <= 0 && a27 == 1) && a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((a3 <= 0 && a12 == 1) && a11 <= 0) && (!(a27 == 1) && a16 == 1) && !(1 == a6) && a5 == 1) && 1 == a0)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && 1 == a0) && a15 == 1)) || ((((1 == a3 && 1 == a6) && a12 == 1) && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 == 1)) || (((((a3 <= 0 && a12 == 1) && 1 == a8) && (!(a27 == 1) && a16 == 1) && !(1 == a6) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((1 == a3 && a12 == 1) && a11 == 1) && a26 == 1) && !(1 == a6) && a5 == 1) && 1 == a4)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && a26 == 1)) || (((((((1 <= a3 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && a15 == 1)) || (((((((a3 <= 0 && !(a12 == 1)) && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1) && a26 == 1) && 1 == a4)) || (((((a3 <= 0 && !(a12 == 1)) && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1)) || ((((a3 <= 0 && a12 == 1) && a11 <= 0) && !(1 == a6) && a5 == 1) && 1 == a4)) || ((((1 <= a3 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 <= 0) && a26 == 1) && a15 == 1)) || ((((a3 <= 0 && (a27 == 1 && !(1 == a6)) && a5 == 1) && a12 == 1) && a11 <= 0) && a26 == 1)) || ((((a3 <= 0 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a15 == 1) && 1 == a4)) || (((((1 == a3 && 1 == a6) && a11 <= 0) && a5 == 1) && a26 == 1) && 1 == a4)) || ((((((a3 <= 0 && a27 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a15 == 1) && 1 == a4)) || (((((1 <= a3 && a12 == 1) && (!(a27 == 1) && a16 == 1) && !(1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a4)) || ((((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 == a3) && a11 <= 0) && a26 == 1) && 1 == a4)) || (((((a27 == 1 && a11 <= 0) && a5 == 1) && a26 == 1) && a15 == 1) && 1 == a4)) || ((((((a3 <= 0 && !(a12 == 1)) && 1 == a6) && a11 <= 0) && a5 == 1) && a16 == 1) && 1 == a4)) || ((((1 == a6 && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 <= 0) && 1 == a0) && 1 == a4)) || (((((1 <= a3 && a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && 1 == a0)) || (((((1 <= a3 && a27 == 1) && a11 <= 0) && 1 == a8) && a5 == 1) && 1 == a0)) || ((((a3 <= 0 && 1 == a6) && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 <= 0) && 1 == a0)) || (((((!(a12 == 1) && 1 <= a3) && a27 == 1) && 1 == a6) && a11 <= 0) && a5 == 1)) || (((((a3 <= 0 && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) || (((a3 <= 0 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 <= 0) && 1 == a4)) || ((((((1 <= a3 && a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && a15 == 1) && 1 == a4)) || (((1 <= a3 && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((((!(a12 == 1) && 1 <= a3) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && a15 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 92.1s, OverallIterations: 19, TraceHistogramMax: 6, AutomataDifference: 29.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 34.8s, HoareTripleCheckerStatistics: 4133 SDtfs, 5525 SDslu, 1702 SDs, 0 SdLazy, 10810 SolverSat, 2193 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 949 GetRequests, 910 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196456occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 6233 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 1914 NumberOfFragments, 2711 HoareAnnotationTreeSize, 3 FomulaSimplifications, 44906 FormulaSimplificationTreeSizeReduction, 17.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 43620 FormulaSimplificationTreeSizeReductionInter, 17.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 6792 NumberOfCodeBlocks, 6792 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6770 ConstructedInterpolants, 0 QuantifiedInterpolants, 3386746 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1515 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 3549/3559 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...