./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label46.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_51cd04f2-8c05-466d-95e4-45181780b96c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_51cd04f2-8c05-466d-95e4-45181780b96c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_51cd04f2-8c05-466d-95e4-45181780b96c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_51cd04f2-8c05-466d-95e4-45181780b96c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label46.c -s /tmp/vcloud-vcloud-master/worker/run_dir_51cd04f2-8c05-466d-95e4-45181780b96c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_51cd04f2-8c05-466d-95e4-45181780b96c/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 040c0aaac4458e8ce6521748c6e651f82b542145 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:55:31,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:55:31,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:55:31,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:55:31,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:55:31,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:55:31,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:55:31,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:55:31,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:55:31,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:55:31,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:55:31,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:55:31,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:55:31,092 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:55:31,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:55:31,094 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:55:31,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:55:31,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:55:31,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:55:31,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:55:31,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:55:31,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:55:31,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:55:31,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:55:31,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:55:31,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:55:31,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:55:31,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:55:31,112 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:55:31,113 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:55:31,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:55:31,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:55:31,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:55:31,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:55:31,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:55:31,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:55:31,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:55:31,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:55:31,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:55:31,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:55:31,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:55:31,121 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_51cd04f2-8c05-466d-95e4-45181780b96c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:55:31,136 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:55:31,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:55:31,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:55:31,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:55:31,138 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:55:31,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:55:31,138 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:55:31,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:55:31,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:55:31,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:55:31,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:55:31,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:55:31,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:55:31,140 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:55:31,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:55:31,140 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:55:31,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:55:31,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:55:31,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:55:31,141 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:55:31,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:55:31,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:55:31,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:55:31,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:55:31,142 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:55:31,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:55:31,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:55:31,143 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:55:31,143 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_51cd04f2-8c05-466d-95e4-45181780b96c/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 -> 040c0aaac4458e8ce6521748c6e651f82b542145 [2019-11-15 22:55:31,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:55:31,184 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:55:31,187 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:55:31,188 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:55:31,189 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:55:31,190 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_51cd04f2-8c05-466d-95e4-45181780b96c/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label46.c [2019-11-15 22:55:31,251 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_51cd04f2-8c05-466d-95e4-45181780b96c/bin/uautomizer/data/2bbd28fc8/bf023683d66849fe8b39d1ebea4d64ac/FLAGae1c2905b [2019-11-15 22:55:31,886 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:55:31,888 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_51cd04f2-8c05-466d-95e4-45181780b96c/sv-benchmarks/c/eca-rers2012/Problem03_label46.c [2019-11-15 22:55:31,910 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_51cd04f2-8c05-466d-95e4-45181780b96c/bin/uautomizer/data/2bbd28fc8/bf023683d66849fe8b39d1ebea4d64ac/FLAGae1c2905b [2019-11-15 22:55:32,023 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_51cd04f2-8c05-466d-95e4-45181780b96c/bin/uautomizer/data/2bbd28fc8/bf023683d66849fe8b39d1ebea4d64ac [2019-11-15 22:55:32,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:55:32,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:55:32,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:55:32,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:55:32,031 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:55:32,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:55:32" (1/1) ... [2019-11-15 22:55:32,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e2ced30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:32, skipping insertion in model container [2019-11-15 22:55:32,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:55:32" (1/1) ... [2019-11-15 22:55:32,043 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:55:32,117 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:55:32,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:55:32,835 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:55:33,094 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:55:33,117 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:55:33,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:33 WrapperNode [2019-11-15 22:55:33,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:55:33,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:55:33,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:55:33,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:55:33,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:33" (1/1) ... [2019-11-15 22:55:33,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:33" (1/1) ... [2019-11-15 22:55:33,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:55:33,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:55:33,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:55:33,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:55:33,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:33" (1/1) ... [2019-11-15 22:55:33,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:33" (1/1) ... [2019-11-15 22:55:33,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:33" (1/1) ... [2019-11-15 22:55:33,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:33" (1/1) ... [2019-11-15 22:55:33,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:33" (1/1) ... [2019-11-15 22:55:33,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:33" (1/1) ... [2019-11-15 22:55:33,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:33" (1/1) ... [2019-11-15 22:55:33,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:55:33,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:55:33,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:55:33,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:55:33,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51cd04f2-8c05-466d-95e4-45181780b96c/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-15 22:55:33,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:55:33,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:55:35,865 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:55:35,865 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:55:35,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:55:35 BoogieIcfgContainer [2019-11-15 22:55:35,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:55:35,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:55:35,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:55:35,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:55:35,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:55:32" (1/3) ... [2019-11-15 22:55:35,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c020b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:55:35, skipping insertion in model container [2019-11-15 22:55:35,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:33" (2/3) ... [2019-11-15 22:55:35,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c020b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:55:35, skipping insertion in model container [2019-11-15 22:55:35,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:55:35" (3/3) ... [2019-11-15 22:55:35,878 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label46.c [2019-11-15 22:55:35,888 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:55:35,898 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:55:35,910 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:55:35,947 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:55:35,947 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:55:35,947 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:55:35,947 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:55:35,948 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:55:35,948 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:55:35,948 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:55:35,948 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:55:35,971 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-15 22:55:36,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-15 22:55:36,006 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:36,007 INFO L380 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] [2019-11-15 22:55:36,009 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:36,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:36,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1730728613, now seen corresponding path program 1 times [2019-11-15 22:55:36,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:36,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784526715] [2019-11-15 22:55:36,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:36,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:36,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:36,866 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-15 22:55:36,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784526715] [2019-11-15 22:55:36,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:55:36,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:55:36,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683277327] [2019-11-15 22:55:36,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:55:36,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:36,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:55:36,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:55:36,889 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-15 22:55:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:38,990 INFO L93 Difference]: Finished difference Result 1068 states and 1913 transitions. [2019-11-15 22:55:38,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:55:38,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-15 22:55:38,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:39,011 INFO L225 Difference]: With dead ends: 1068 [2019-11-15 22:55:39,011 INFO L226 Difference]: Without dead ends: 670 [2019-11-15 22:55:39,016 INFO L600 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-15 22:55:39,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-11-15 22:55:39,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 456. [2019-11-15 22:55:39,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-11-15 22:55:39,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 704 transitions. [2019-11-15 22:55:39,094 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 704 transitions. Word has length 185 [2019-11-15 22:55:39,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:39,095 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 704 transitions. [2019-11-15 22:55:39,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:55:39,096 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 704 transitions. [2019-11-15 22:55:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-15 22:55:39,099 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:39,100 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 22:55:39,100 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:39,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:39,100 INFO L82 PathProgramCache]: Analyzing trace with hash 689139339, now seen corresponding path program 1 times [2019-11-15 22:55:39,101 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:39,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453079086] [2019-11-15 22:55:39,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:39,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:39,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:39,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:55:39,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453079086] [2019-11-15 22:55:39,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:55:39,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:55:39,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790246155] [2019-11-15 22:55:39,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:55:39,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:39,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:55:39,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:55:39,248 INFO L87 Difference]: Start difference. First operand 456 states and 704 transitions. Second operand 4 states. [2019-11-15 22:55:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:40,729 INFO L93 Difference]: Finished difference Result 1762 states and 2741 transitions. [2019-11-15 22:55:40,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:55:40,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-11-15 22:55:40,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:40,737 INFO L225 Difference]: With dead ends: 1762 [2019-11-15 22:55:40,737 INFO L226 Difference]: Without dead ends: 1308 [2019-11-15 22:55:40,740 INFO L600 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-15 22:55:40,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-11-15 22:55:40,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 869. [2019-11-15 22:55:40,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-11-15 22:55:40,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1278 transitions. [2019-11-15 22:55:40,780 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1278 transitions. Word has length 190 [2019-11-15 22:55:40,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:40,781 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 1278 transitions. [2019-11-15 22:55:40,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:55:40,781 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1278 transitions. [2019-11-15 22:55:40,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-15 22:55:40,784 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:40,785 INFO L380 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] [2019-11-15 22:55:40,785 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:40,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:40,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1152691044, now seen corresponding path program 1 times [2019-11-15 22:55:40,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:40,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756328672] [2019-11-15 22:55:40,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:40,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:40,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:40,857 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-15 22:55:40,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756328672] [2019-11-15 22:55:40,858 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:55:40,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:55:40,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692065170] [2019-11-15 22:55:40,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:55:40,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:40,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:55:40,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:55:40,860 INFO L87 Difference]: Start difference. First operand 869 states and 1278 transitions. Second operand 3 states. [2019-11-15 22:55:41,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:41,844 INFO L93 Difference]: Finished difference Result 2567 states and 3793 transitions. [2019-11-15 22:55:41,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:55:41,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-15 22:55:41,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:41,854 INFO L225 Difference]: With dead ends: 2567 [2019-11-15 22:55:41,857 INFO L226 Difference]: Without dead ends: 1700 [2019-11-15 22:55:41,858 INFO L600 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-15 22:55:41,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-11-15 22:55:41,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1683. [2019-11-15 22:55:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2019-11-15 22:55:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2433 transitions. [2019-11-15 22:55:41,912 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2433 transitions. Word has length 193 [2019-11-15 22:55:41,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:41,914 INFO L462 AbstractCegarLoop]: Abstraction has 1683 states and 2433 transitions. [2019-11-15 22:55:41,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:55:41,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2433 transitions. [2019-11-15 22:55:41,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-15 22:55:41,920 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:41,920 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:55:41,920 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:41,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:41,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1740913381, now seen corresponding path program 1 times [2019-11-15 22:55:41,921 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:41,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817798915] [2019-11-15 22:55:41,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:41,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:41,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 22:55:42,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817798915] [2019-11-15 22:55:42,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:55:42,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:55:42,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186130433] [2019-11-15 22:55:42,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:55:42,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:42,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:55:42,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:55:42,027 INFO L87 Difference]: Start difference. First operand 1683 states and 2433 transitions. Second operand 3 states. [2019-11-15 22:55:42,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:42,965 INFO L93 Difference]: Finished difference Result 4189 states and 6035 transitions. [2019-11-15 22:55:42,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:55:42,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-11-15 22:55:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:42,979 INFO L225 Difference]: With dead ends: 4189 [2019-11-15 22:55:42,979 INFO L226 Difference]: Without dead ends: 2508 [2019-11-15 22:55:42,982 INFO L600 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-15 22:55:42,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-11-15 22:55:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2507. [2019-11-15 22:55:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2019-11-15 22:55:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3546 transitions. [2019-11-15 22:55:43,034 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3546 transitions. Word has length 200 [2019-11-15 22:55:43,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:43,035 INFO L462 AbstractCegarLoop]: Abstraction has 2507 states and 3546 transitions. [2019-11-15 22:55:43,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:55:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3546 transitions. [2019-11-15 22:55:43,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-15 22:55:43,041 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:43,041 INFO L380 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] [2019-11-15 22:55:43,042 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:43,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:43,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1587791275, now seen corresponding path program 1 times [2019-11-15 22:55:43,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:43,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969820867] [2019-11-15 22:55:43,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:43,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:43,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:43,133 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-15 22:55:43,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969820867] [2019-11-15 22:55:43,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:55:43,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:55:43,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596343329] [2019-11-15 22:55:43,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:55:43,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:43,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:55:43,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:55:43,137 INFO L87 Difference]: Start difference. First operand 2507 states and 3546 transitions. Second operand 3 states. [2019-11-15 22:55:43,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:43,646 INFO L93 Difference]: Finished difference Result 7497 states and 10609 transitions. [2019-11-15 22:55:43,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:55:43,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-15 22:55:43,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:43,672 INFO L225 Difference]: With dead ends: 7497 [2019-11-15 22:55:43,672 INFO L226 Difference]: Without dead ends: 4992 [2019-11-15 22:55:43,675 INFO L600 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-15 22:55:43,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4992 states. [2019-11-15 22:55:43,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4992 to 4989. [2019-11-15 22:55:43,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4989 states. [2019-11-15 22:55:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 7044 transitions. [2019-11-15 22:55:43,786 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 7044 transitions. Word has length 205 [2019-11-15 22:55:43,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:43,786 INFO L462 AbstractCegarLoop]: Abstraction has 4989 states and 7044 transitions. [2019-11-15 22:55:43,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:55:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 7044 transitions. [2019-11-15 22:55:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-15 22:55:43,798 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:43,798 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:55:43,799 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:43,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:43,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1507804289, now seen corresponding path program 1 times [2019-11-15 22:55:43,799 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:43,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34489740] [2019-11-15 22:55:43,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:43,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:43,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:43,916 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-15 22:55:43,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34489740] [2019-11-15 22:55:43,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800990712] [2019-11-15 22:55:43,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51cd04f2-8c05-466d-95e4-45181780b96c/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-15 22:55:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:44,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:55:44,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:55:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-15 22:55:44,144 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:55:44,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-15 22:55:44,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646612207] [2019-11-15 22:55:44,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:55:44,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:44,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:55:44,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:55:44,146 INFO L87 Difference]: Start difference. First operand 4989 states and 7044 transitions. Second operand 3 states. [2019-11-15 22:55:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:44,524 INFO L93 Difference]: Finished difference Result 14957 states and 21122 transitions. [2019-11-15 22:55:44,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:55:44,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-11-15 22:55:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:44,579 INFO L225 Difference]: With dead ends: 14957 [2019-11-15 22:55:44,579 INFO L226 Difference]: Without dead ends: 9970 [2019-11-15 22:55:44,586 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 214 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-15 22:55:44,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9970 states. [2019-11-15 22:55:44,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9970 to 9968. [2019-11-15 22:55:44,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9968 states. [2019-11-15 22:55:44,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 14047 transitions. [2019-11-15 22:55:44,795 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 14047 transitions. Word has length 214 [2019-11-15 22:55:44,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:44,796 INFO L462 AbstractCegarLoop]: Abstraction has 9968 states and 14047 transitions. [2019-11-15 22:55:44,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:55:44,798 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 14047 transitions. [2019-11-15 22:55:44,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-15 22:55:44,815 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:44,816 INFO L380 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] [2019-11-15 22:55:45,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:45,020 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:45,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:45,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1558518551, now seen corresponding path program 1 times [2019-11-15 22:55:45,020 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:45,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870491098] [2019-11-15 22:55:45,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:45,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:45,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:45,340 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-15 22:55:45,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870491098] [2019-11-15 22:55:45,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:55:45,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:55:45,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481886789] [2019-11-15 22:55:45,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:55:45,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:45,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:55:45,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:55:45,343 INFO L87 Difference]: Start difference. First operand 9968 states and 14047 transitions. Second operand 5 states. [2019-11-15 22:55:47,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:47,398 INFO L93 Difference]: Finished difference Result 22448 states and 31892 transitions. [2019-11-15 22:55:47,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:55:47,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2019-11-15 22:55:47,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:47,447 INFO L225 Difference]: With dead ends: 22448 [2019-11-15 22:55:47,447 INFO L226 Difference]: Without dead ends: 12482 [2019-11-15 22:55:47,460 INFO L600 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-15 22:55:47,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12482 states. [2019-11-15 22:55:47,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12482 to 10780. [2019-11-15 22:55:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10780 states. [2019-11-15 22:55:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10780 states to 10780 states and 15197 transitions. [2019-11-15 22:55:47,671 INFO L78 Accepts]: Start accepts. Automaton has 10780 states and 15197 transitions. Word has length 223 [2019-11-15 22:55:47,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:47,671 INFO L462 AbstractCegarLoop]: Abstraction has 10780 states and 15197 transitions. [2019-11-15 22:55:47,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:55:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 10780 states and 15197 transitions. [2019-11-15 22:55:47,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-15 22:55:47,690 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:47,690 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:55:47,691 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:47,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:47,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1779815714, now seen corresponding path program 1 times [2019-11-15 22:55:47,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:47,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916160156] [2019-11-15 22:55:47,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:47,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:47,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 22:55:47,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916160156] [2019-11-15 22:55:47,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:55:47,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:55:47,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643786606] [2019-11-15 22:55:47,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:55:47,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:47,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:55:47,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:55:47,804 INFO L87 Difference]: Start difference. First operand 10780 states and 15197 transitions. Second operand 3 states. [2019-11-15 22:55:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:48,945 INFO L93 Difference]: Finished difference Result 21582 states and 30438 transitions. [2019-11-15 22:55:48,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:55:48,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-11-15 22:55:48,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:48,966 INFO L225 Difference]: With dead ends: 21582 [2019-11-15 22:55:48,966 INFO L226 Difference]: Without dead ends: 10804 [2019-11-15 22:55:48,979 INFO L600 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-15 22:55:48,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10804 states. [2019-11-15 22:55:49,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10804 to 10780. [2019-11-15 22:55:49,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10780 states. [2019-11-15 22:55:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10780 states to 10780 states and 14411 transitions. [2019-11-15 22:55:49,145 INFO L78 Accepts]: Start accepts. Automaton has 10780 states and 14411 transitions. Word has length 223 [2019-11-15 22:55:49,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:49,145 INFO L462 AbstractCegarLoop]: Abstraction has 10780 states and 14411 transitions. [2019-11-15 22:55:49,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:55:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 10780 states and 14411 transitions. [2019-11-15 22:55:49,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-15 22:55:49,162 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:49,162 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:55:49,163 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:49,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:49,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1292769297, now seen corresponding path program 1 times [2019-11-15 22:55:49,163 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:49,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968227499] [2019-11-15 22:55:49,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:49,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:49,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-15 22:55:49,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968227499] [2019-11-15 22:55:49,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:55:49,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:55:49,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892413984] [2019-11-15 22:55:49,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:55:49,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:49,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:55:49,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:55:49,264 INFO L87 Difference]: Start difference. First operand 10780 states and 14411 transitions. Second operand 4 states. [2019-11-15 22:55:50,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:50,940 INFO L93 Difference]: Finished difference Result 39484 states and 52680 transitions. [2019-11-15 22:55:50,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:55:50,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2019-11-15 22:55:50,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:50,992 INFO L225 Difference]: With dead ends: 39484 [2019-11-15 22:55:50,992 INFO L226 Difference]: Without dead ends: 28706 [2019-11-15 22:55:51,010 INFO L600 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-15 22:55:51,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28706 states. [2019-11-15 22:55:51,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28706 to 20132. [2019-11-15 22:55:51,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20132 states. [2019-11-15 22:55:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20132 states to 20132 states and 26029 transitions. [2019-11-15 22:55:51,614 INFO L78 Accepts]: Start accepts. Automaton has 20132 states and 26029 transitions. Word has length 223 [2019-11-15 22:55:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:51,615 INFO L462 AbstractCegarLoop]: Abstraction has 20132 states and 26029 transitions. [2019-11-15 22:55:51,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:55:51,615 INFO L276 IsEmpty]: Start isEmpty. Operand 20132 states and 26029 transitions. [2019-11-15 22:55:51,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-15 22:55:51,644 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:51,645 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 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] [2019-11-15 22:55:51,645 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:51,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:51,645 INFO L82 PathProgramCache]: Analyzing trace with hash 959111984, now seen corresponding path program 1 times [2019-11-15 22:55:51,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:51,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997170938] [2019-11-15 22:55:51,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:51,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:51,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-15 22:55:51,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997170938] [2019-11-15 22:55:51,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:55:51,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:55:51,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947936724] [2019-11-15 22:55:51,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:55:51,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:51,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:55:51,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:55:51,752 INFO L87 Difference]: Start difference. First operand 20132 states and 26029 transitions. Second operand 3 states. [2019-11-15 22:55:52,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:52,933 INFO L93 Difference]: Finished difference Result 55495 states and 71447 transitions. [2019-11-15 22:55:52,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:55:52,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-11-15 22:55:52,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:52,997 INFO L225 Difference]: With dead ends: 55495 [2019-11-15 22:55:52,997 INFO L226 Difference]: Without dead ends: 35365 [2019-11-15 22:55:53,026 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:55:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35365 states. [2019-11-15 22:55:53,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35365 to 35357. [2019-11-15 22:55:53,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35357 states. [2019-11-15 22:55:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35357 states to 35357 states and 41636 transitions. [2019-11-15 22:55:53,567 INFO L78 Accepts]: Start accepts. Automaton has 35357 states and 41636 transitions. Word has length 229 [2019-11-15 22:55:53,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:53,568 INFO L462 AbstractCegarLoop]: Abstraction has 35357 states and 41636 transitions. [2019-11-15 22:55:53,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:55:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 35357 states and 41636 transitions. [2019-11-15 22:55:53,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-15 22:55:53,608 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:53,608 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:55:53,609 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:53,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:53,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1066196502, now seen corresponding path program 1 times [2019-11-15 22:55:53,609 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:53,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521443469] [2019-11-15 22:55:53,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:53,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:53,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:55:53,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521443469] [2019-11-15 22:55:53,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:55:53,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:55:53,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870422502] [2019-11-15 22:55:53,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:55:53,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:53,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:55:53,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:55:53,748 INFO L87 Difference]: Start difference. First operand 35357 states and 41636 transitions. Second operand 4 states. [2019-11-15 22:55:55,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:55,726 INFO L93 Difference]: Finished difference Result 83915 states and 100059 transitions. [2019-11-15 22:55:55,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:55:55,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-11-15 22:55:55,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:55,808 INFO L225 Difference]: With dead ends: 83915 [2019-11-15 22:55:55,808 INFO L226 Difference]: Without dead ends: 48560 [2019-11-15 22:55:55,832 INFO L600 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-15 22:55:55,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48560 states. [2019-11-15 22:55:56,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48560 to 48552. [2019-11-15 22:55:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48552 states. [2019-11-15 22:55:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48552 states to 48552 states and 55757 transitions. [2019-11-15 22:55:56,451 INFO L78 Accepts]: Start accepts. Automaton has 48552 states and 55757 transitions. Word has length 240 [2019-11-15 22:55:56,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:56,451 INFO L462 AbstractCegarLoop]: Abstraction has 48552 states and 55757 transitions. [2019-11-15 22:55:56,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:55:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 48552 states and 55757 transitions. [2019-11-15 22:55:56,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-11-15 22:55:56,484 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:56,485 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:55:56,485 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:56,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:56,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1317057987, now seen corresponding path program 1 times [2019-11-15 22:55:56,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:56,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568853413] [2019-11-15 22:55:56,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:56,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:56,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 22:55:56,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568853413] [2019-11-15 22:55:56,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:55:56,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:55:56,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979137292] [2019-11-15 22:55:56,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:55:56,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:56,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:55:56,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:55:56,666 INFO L87 Difference]: Start difference. First operand 48552 states and 55757 transitions. Second operand 3 states. [2019-11-15 22:55:57,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:57,795 INFO L93 Difference]: Finished difference Result 96192 states and 110404 transitions. [2019-11-15 22:55:57,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:55:57,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2019-11-15 22:55:57,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:57,883 INFO L225 Difference]: With dead ends: 96192 [2019-11-15 22:55:57,883 INFO L226 Difference]: Without dead ends: 47642 [2019-11-15 22:55:57,908 INFO L600 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-15 22:55:57,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47642 states. [2019-11-15 22:55:58,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47642 to 47642. [2019-11-15 22:55:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47642 states. [2019-11-15 22:55:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47642 states to 47642 states and 54149 transitions. [2019-11-15 22:55:58,583 INFO L78 Accepts]: Start accepts. Automaton has 47642 states and 54149 transitions. Word has length 272 [2019-11-15 22:55:58,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:58,584 INFO L462 AbstractCegarLoop]: Abstraction has 47642 states and 54149 transitions. [2019-11-15 22:55:58,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:55:58,584 INFO L276 IsEmpty]: Start isEmpty. Operand 47642 states and 54149 transitions. [2019-11-15 22:55:58,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-11-15 22:55:58,648 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:58,649 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:55:58,650 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:55:58,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:58,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2040139229, now seen corresponding path program 1 times [2019-11-15 22:55:58,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:58,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448985552] [2019-11-15 22:55:58,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:58,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:58,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-15 22:55:58,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448985552] [2019-11-15 22:55:58,871 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:55:58,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:55:58,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953430637] [2019-11-15 22:55:58,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:55:58,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:58,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:55:58,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:55:58,873 INFO L87 Difference]: Start difference. First operand 47642 states and 54149 transitions. Second operand 4 states. [2019-11-15 22:56:00,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:56:00,952 INFO L93 Difference]: Finished difference Result 130676 states and 148947 transitions. [2019-11-15 22:56:00,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:56:00,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 283 [2019-11-15 22:56:00,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:56:01,114 INFO L225 Difference]: With dead ends: 130676 [2019-11-15 22:56:01,114 INFO L226 Difference]: Without dead ends: 83036 [2019-11-15 22:56:01,153 INFO L600 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-15 22:56:01,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83036 states. [2019-11-15 22:56:02,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83036 to 60228. [2019-11-15 22:56:02,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60228 states. [2019-11-15 22:56:02,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60228 states to 60228 states and 69021 transitions. [2019-11-15 22:56:02,470 INFO L78 Accepts]: Start accepts. Automaton has 60228 states and 69021 transitions. Word has length 283 [2019-11-15 22:56:02,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:56:02,471 INFO L462 AbstractCegarLoop]: Abstraction has 60228 states and 69021 transitions. [2019-11-15 22:56:02,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:56:02,471 INFO L276 IsEmpty]: Start isEmpty. Operand 60228 states and 69021 transitions. [2019-11-15 22:56:02,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-11-15 22:56:02,505 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:56:02,506 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:56:02,506 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:56:02,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:56:02,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1305533371, now seen corresponding path program 1 times [2019-11-15 22:56:02,507 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:56:02,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345648756] [2019-11-15 22:56:02,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:02,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:02,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:56:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:56:02,714 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 22:56:02,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345648756] [2019-11-15 22:56:02,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:56:02,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:56:02,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488205996] [2019-11-15 22:56:02,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:56:02,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:56:02,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:56:02,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:56:02,718 INFO L87 Difference]: Start difference. First operand 60228 states and 69021 transitions. Second operand 3 states. [2019-11-15 22:56:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:56:03,670 INFO L93 Difference]: Finished difference Result 120446 states and 138032 transitions. [2019-11-15 22:56:03,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:56:03,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-11-15 22:56:03,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:56:03,734 INFO L225 Difference]: With dead ends: 120446 [2019-11-15 22:56:03,735 INFO L226 Difference]: Without dead ends: 60220 [2019-11-15 22:56:03,763 INFO L600 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-15 22:56:03,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60220 states. [2019-11-15 22:56:04,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60220 to 60220. [2019-11-15 22:56:04,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60220 states. [2019-11-15 22:56:04,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60220 states to 60220 states and 69005 transitions. [2019-11-15 22:56:04,942 INFO L78 Accepts]: Start accepts. Automaton has 60220 states and 69005 transitions. Word has length 310 [2019-11-15 22:56:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:56:04,942 INFO L462 AbstractCegarLoop]: Abstraction has 60220 states and 69005 transitions. [2019-11-15 22:56:04,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:56:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 60220 states and 69005 transitions. [2019-11-15 22:56:04,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-11-15 22:56:04,971 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:56:04,972 INFO L380 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:56:04,972 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:56:04,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:56:04,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1481379333, now seen corresponding path program 1 times [2019-11-15 22:56:04,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:56:04,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079180633] [2019-11-15 22:56:04,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:04,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:04,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:56:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:56:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 3 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-15 22:56:05,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079180633] [2019-11-15 22:56:05,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800437642] [2019-11-15 22:56:05,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51cd04f2-8c05-466d-95e4-45181780b96c/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-15 22:56:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:56:05,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:56:05,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:56:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-15 22:56:05,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:56:05,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 22:56:05,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991470000] [2019-11-15 22:56:05,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:56:05,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:56:05,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:56:05,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:56:05,407 INFO L87 Difference]: Start difference. First operand 60220 states and 69005 transitions. Second operand 3 states. [2019-11-15 22:56:06,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:56:06,628 INFO L93 Difference]: Finished difference Result 123720 states and 141411 transitions. [2019-11-15 22:56:06,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:56:06,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-11-15 22:56:06,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:56:06,680 INFO L225 Difference]: With dead ends: 123720 [2019-11-15 22:56:06,680 INFO L226 Difference]: Without dead ends: 63502 [2019-11-15 22:56:06,710 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:56:06,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63502 states. [2019-11-15 22:56:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63502 to 63468. [2019-11-15 22:56:07,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63468 states. [2019-11-15 22:56:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63468 states to 63468 states and 71542 transitions. [2019-11-15 22:56:07,312 INFO L78 Accepts]: Start accepts. Automaton has 63468 states and 71542 transitions. Word has length 316 [2019-11-15 22:56:07,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:56:07,313 INFO L462 AbstractCegarLoop]: Abstraction has 63468 states and 71542 transitions. [2019-11-15 22:56:07,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:56:07,313 INFO L276 IsEmpty]: Start isEmpty. Operand 63468 states and 71542 transitions. [2019-11-15 22:56:07,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-15 22:56:07,347 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:56:07,348 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:56:07,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:56:07,552 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:56:07,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:56:07,552 INFO L82 PathProgramCache]: Analyzing trace with hash 970355755, now seen corresponding path program 1 times [2019-11-15 22:56:07,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:56:07,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076833739] [2019-11-15 22:56:07,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:07,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:07,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:56:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:56:08,422 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:56:08,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076833739] [2019-11-15 22:56:08,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:56:08,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:56:08,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912692019] [2019-11-15 22:56:08,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:56:08,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:56:08,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:56:08,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:56:08,425 INFO L87 Difference]: Start difference. First operand 63468 states and 71542 transitions. Second operand 3 states. [2019-11-15 22:56:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:56:09,515 INFO L93 Difference]: Finished difference Result 130213 states and 147030 transitions. [2019-11-15 22:56:09,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:56:09,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-11-15 22:56:09,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:56:09,575 INFO L225 Difference]: With dead ends: 130213 [2019-11-15 22:56:09,575 INFO L226 Difference]: Without dead ends: 66747 [2019-11-15 22:56:09,601 INFO L600 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-15 22:56:09,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66747 states. [2019-11-15 22:56:10,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66747 to 66745. [2019-11-15 22:56:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66745 states. [2019-11-15 22:56:10,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66745 states to 66745 states and 74820 transitions. [2019-11-15 22:56:10,188 INFO L78 Accepts]: Start accepts. Automaton has 66745 states and 74820 transitions. Word has length 336 [2019-11-15 22:56:10,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:56:10,189 INFO L462 AbstractCegarLoop]: Abstraction has 66745 states and 74820 transitions. [2019-11-15 22:56:10,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:56:10,189 INFO L276 IsEmpty]: Start isEmpty. Operand 66745 states and 74820 transitions. [2019-11-15 22:56:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-11-15 22:56:10,211 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:56:10,211 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:56:10,211 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:56:10,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:56:10,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1175765495, now seen corresponding path program 1 times [2019-11-15 22:56:10,212 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:56:10,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208370057] [2019-11-15 22:56:10,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:10,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:10,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:56:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:56:10,413 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-15 22:56:10,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208370057] [2019-11-15 22:56:10,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:56:10,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:56:10,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065128379] [2019-11-15 22:56:10,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:56:10,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:56:10,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:56:10,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:56:10,416 INFO L87 Difference]: Start difference. First operand 66745 states and 74820 transitions. Second operand 4 states. [2019-11-15 22:56:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:56:12,276 INFO L93 Difference]: Finished difference Result 140841 states and 158227 transitions. [2019-11-15 22:56:12,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:56:12,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 342 [2019-11-15 22:56:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:56:12,342 INFO L225 Difference]: With dead ends: 140841 [2019-11-15 22:56:12,342 INFO L226 Difference]: Without dead ends: 74098 [2019-11-15 22:56:12,365 INFO L600 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-15 22:56:12,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74098 states. [2019-11-15 22:56:12,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74098 to 74071. [2019-11-15 22:56:12,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74071 states. [2019-11-15 22:56:13,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74071 states to 74071 states and 82953 transitions. [2019-11-15 22:56:13,010 INFO L78 Accepts]: Start accepts. Automaton has 74071 states and 82953 transitions. Word has length 342 [2019-11-15 22:56:13,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:56:13,011 INFO L462 AbstractCegarLoop]: Abstraction has 74071 states and 82953 transitions. [2019-11-15 22:56:13,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:56:13,011 INFO L276 IsEmpty]: Start isEmpty. Operand 74071 states and 82953 transitions. [2019-11-15 22:56:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-11-15 22:56:13,034 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:56:13,035 INFO L380 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:56:13,035 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:56:13,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:56:13,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1010752569, now seen corresponding path program 1 times [2019-11-15 22:56:13,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:56:13,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933690139] [2019-11-15 22:56:13,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:13,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:56:13,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:56:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:56:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-15 22:56:13,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933690139] [2019-11-15 22:56:13,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922730833] [2019-11-15 22:56:13,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51cd04f2-8c05-466d-95e4-45181780b96c/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-15 22:56:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:56:13,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:56:13,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:56:13,496 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-11-15 22:56:13,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:56:13,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 22:56:13,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845364679] [2019-11-15 22:56:13,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:56:13,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:56:13,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:56:13,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:56:13,497 INFO L87 Difference]: Start difference. First operand 74071 states and 82953 transitions. Second operand 3 states. [2019-11-15 22:56:14,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:56:14,518 INFO L93 Difference]: Finished difference Result 145701 states and 163234 transitions. [2019-11-15 22:56:14,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:56:14,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2019-11-15 22:56:14,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:56:14,519 INFO L225 Difference]: With dead ends: 145701 [2019-11-15 22:56:14,520 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:56:14,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:56:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:56:14,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:56:14,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:56:14,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:56:14,552 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 348 [2019-11-15 22:56:14,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:56:14,553 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:56:14,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:56:14,553 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:56:14,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:56:14,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:56:14,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:56:16,382 WARN L191 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 742 DAG size of output: 406 [2019-11-15 22:56:17,735 WARN L191 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 742 DAG size of output: 406 [2019-11-15 22:56:20,087 WARN L191 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 373 DAG size of output: 76 [2019-11-15 22:56:22,072 WARN L191 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 373 DAG size of output: 76 [2019-11-15 22:56:22,073 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-15 22:56:22,073 INFO L443 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-15 22:56:22,073 INFO L443 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,073 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,074 INFO L443 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,074 INFO L443 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,074 INFO L443 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,074 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,074 INFO L443 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,074 INFO L443 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-15 22:56:22,074 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,074 INFO L443 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-15 22:56:22,074 INFO L443 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-15 22:56:22,074 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,074 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,074 INFO L443 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,074 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,074 INFO L443 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-15 22:56:22,074 INFO L443 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-15 22:56:22,074 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,075 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,075 INFO L443 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,075 INFO L443 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,075 INFO L443 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,075 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,075 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,075 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,075 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,075 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,075 INFO L443 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-15 22:56:22,075 INFO L443 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-15 22:56:22,075 INFO L443 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-15 22:56:22,075 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,075 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,075 INFO L443 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,075 INFO L443 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,076 INFO L443 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,076 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,076 INFO L443 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-15 22:56:22,076 INFO L443 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-15 22:56:22,076 INFO L443 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-15 22:56:22,076 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,076 INFO L443 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,076 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,076 INFO L443 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,076 INFO L443 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,076 INFO L443 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,076 INFO L443 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-15 22:56:22,077 INFO L443 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-15 22:56:22,077 INFO L443 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-15 22:56:22,077 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,077 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,077 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,077 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-15 22:56:22,077 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,077 INFO L443 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-15 22:56:22,077 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,077 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,077 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-15 22:56:22,077 INFO L443 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-15 22:56:22,078 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,078 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1590) no Hoare annotation was computed. [2019-11-15 22:56:22,078 INFO L443 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,078 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,078 INFO L443 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,078 INFO L443 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,078 INFO L443 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,078 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,078 INFO L443 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-15 22:56:22,078 INFO L443 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-15 22:56:22,078 INFO L443 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-15 22:56:22,079 INFO L443 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-15 22:56:22,079 INFO L443 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-15 22:56:22,079 INFO L443 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,079 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,079 INFO L443 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,079 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,079 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,079 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,079 INFO L443 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,079 INFO L443 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,079 INFO L443 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,079 INFO L443 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,079 INFO L443 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-15 22:56:22,080 INFO L443 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-15 22:56:22,080 INFO L443 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-15 22:56:22,080 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,080 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,080 INFO L443 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,080 INFO L443 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,080 INFO L443 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,080 INFO L443 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,080 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,080 INFO L443 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,080 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,080 INFO L443 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-15 22:56:22,081 INFO L443 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-15 22:56:22,081 INFO L443 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-15 22:56:22,081 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-15 22:56:22,081 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-15 22:56:22,081 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,081 INFO L443 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,081 INFO L443 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,081 INFO L443 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,081 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,081 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:56:22,081 INFO L443 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,081 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,081 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,081 INFO L443 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-15 22:56:22,081 INFO L443 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-15 22:56:22,082 INFO L443 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-15 22:56:22,082 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,082 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,082 INFO L443 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,082 INFO L443 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-15 22:56:22,082 INFO L443 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-15 22:56:22,082 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,082 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,082 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,082 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-15 22:56:22,082 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,082 INFO L443 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-15 22:56:22,082 INFO L443 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,082 INFO L443 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-15 22:56:22,082 INFO L443 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,082 INFO L443 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,082 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-15 22:56:22,083 INFO L443 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-15 22:56:22,083 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-15 22:56:22,083 INFO L443 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-15 22:56:22,083 INFO L443 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-15 22:56:22,083 INFO L443 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-15 22:56:22,083 INFO L443 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-15 22:56:22,083 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,083 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,083 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,084 INFO L439 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse5 (= ~a12~0 1))) (let ((.cse1 (= ~a27~0 1)) (.cse16 (not .cse5)) (.cse8 (not (= 1 ~a11~0)))) (let ((.cse9 (and .cse16 .cse8)) (.cse7 (= ~a5~0 1)) (.cse2 (= 1 ~a6~0)) (.cse14 (not .cse1)) (.cse10 (= ~a16~0 1))) (let ((.cse17 (and .cse14 .cse10 .cse8)) (.cse4 (= 1 ~a3~0)) (.cse12 (= ~a26~0 1)) (.cse18 (<= ~a20~0 0)) (.cse11 (not .cse2)) (.cse13 (<= ~a3~0 0)) (.cse6 (<= ~a26~0 0)) (.cse0 (= ~a18~0 1)) (.cse15 (<= 2 ~a3~0)) (.cse3 (and .cse9 .cse7))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8) (and (and .cse4 (and (and .cse9 .cse10) .cse11) .cse7) .cse0) (and .cse0 .cse7 .cse12 .cse8) (and .cse13 .cse0 .cse1 .cse7 .cse10) (and .cse13 .cse0 .cse7 .cse12) (and .cse0 .cse4 .cse2 .cse5 .cse6 .cse7 (and .cse14 .cse10)) (and .cse0 .cse15 .cse1 .cse7 .cse11 .cse12) (and .cse0 .cse1 .cse7 .cse12 .cse10) (and .cse0 .cse15 .cse1 (and .cse7 .cse10 .cse8)) (and (<= ~a6~0 0) .cse0 .cse7 .cse12) (and (and (and .cse16 .cse1 .cse11 .cse10) .cse7) .cse0) (and .cse0 .cse15 .cse1 .cse2 .cse5 .cse7 .cse10) (and .cse0 .cse15 (and (and .cse16 .cse1 .cse11) .cse7)) (and .cse13 .cse0 .cse17 .cse5 .cse6 .cse7) (and .cse0 .cse15 .cse17 .cse2 .cse6 .cse7) (and .cse0 (and .cse4 (and .cse9 .cse11 .cse18) .cse7)) (and .cse0 .cse15 .cse6 .cse7 (and .cse16 .cse11)) (and .cse0 .cse1 (and (and .cse16 .cse11 .cse18) .cse7)) (and .cse16 .cse0 .cse7 .cse12) (and .cse13 .cse0 .cse1 .cse7 .cse18) (and .cse13 .cse0 .cse6 .cse7 (and .cse5 .cse11 .cse8)) (and .cse0 .cse15 .cse1 .cse6 .cse7 .cse8) (and .cse13 .cse16 .cse0 .cse1 .cse7) (and .cse16 .cse0 .cse15 .cse1 .cse6 .cse7) (and .cse0 .cse15 .cse3)))))) [2019-11-15 22:56:22,084 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,084 INFO L443 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,084 INFO L443 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,084 INFO L443 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-15 22:56:22,084 INFO L443 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-15 22:56:22,086 INFO L443 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,086 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,086 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 22:56:22,086 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,086 INFO L446 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-15 22:56:22,086 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,086 INFO L443 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,086 INFO L443 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,086 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,087 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,087 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,087 INFO L443 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-15 22:56:22,087 INFO L443 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-15 22:56:22,087 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,087 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,087 INFO L443 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,087 INFO L443 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,088 INFO L443 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,088 INFO L443 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,088 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,088 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,088 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,088 INFO L443 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-15 22:56:22,088 INFO L443 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-15 22:56:22,089 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,089 INFO L443 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,089 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-15 22:56:22,089 INFO L443 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-15 22:56:22,089 INFO L443 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,090 INFO L439 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse5 (= ~a12~0 1))) (let ((.cse1 (= ~a27~0 1)) (.cse16 (not .cse5)) (.cse8 (not (= 1 ~a11~0)))) (let ((.cse9 (and .cse16 .cse8)) (.cse7 (= ~a5~0 1)) (.cse2 (= 1 ~a6~0)) (.cse14 (not .cse1)) (.cse10 (= ~a16~0 1))) (let ((.cse17 (and .cse14 .cse10 .cse8)) (.cse4 (= 1 ~a3~0)) (.cse12 (= ~a26~0 1)) (.cse18 (<= ~a20~0 0)) (.cse11 (not .cse2)) (.cse13 (<= ~a3~0 0)) (.cse6 (<= ~a26~0 0)) (.cse0 (= ~a18~0 1)) (.cse15 (<= 2 ~a3~0)) (.cse3 (and .cse9 .cse7))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8) (and (and .cse4 (and (and .cse9 .cse10) .cse11) .cse7) .cse0) (and .cse0 .cse7 .cse12 .cse8) (and .cse13 .cse0 .cse1 .cse7 .cse10) (and .cse13 .cse0 .cse7 .cse12) (and .cse0 .cse4 .cse2 .cse5 .cse6 .cse7 (and .cse14 .cse10)) (and .cse0 .cse15 .cse1 .cse7 .cse11 .cse12) (and .cse0 .cse1 .cse7 .cse12 .cse10) (and .cse0 .cse15 .cse1 (and .cse7 .cse10 .cse8)) (and (<= ~a6~0 0) .cse0 .cse7 .cse12) (and (and (and .cse16 .cse1 .cse11 .cse10) .cse7) .cse0) (and .cse0 .cse15 .cse1 .cse2 .cse5 .cse7 .cse10) (and .cse0 .cse15 (and (and .cse16 .cse1 .cse11) .cse7)) (and .cse13 .cse0 .cse17 .cse5 .cse6 .cse7) (and .cse0 .cse15 .cse17 .cse2 .cse6 .cse7) (and .cse0 (and .cse4 (and .cse9 .cse11 .cse18) .cse7)) (and .cse0 .cse15 .cse6 .cse7 (and .cse16 .cse11)) (and .cse0 .cse1 (and (and .cse16 .cse11 .cse18) .cse7)) (and .cse16 .cse0 .cse7 .cse12) (and .cse13 .cse0 .cse1 .cse7 .cse18) (and .cse13 .cse0 .cse6 .cse7 (and .cse5 .cse11 .cse8)) (and .cse0 .cse15 .cse1 .cse6 .cse7 .cse8) (and .cse13 .cse16 .cse0 .cse1 .cse7) (and .cse16 .cse0 .cse15 .cse1 .cse6 .cse7) (and .cse0 .cse15 .cse3)))))) [2019-11-15 22:56:22,090 INFO L443 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,090 INFO L443 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,090 INFO L443 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,090 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,090 INFO L443 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-15 22:56:22,090 INFO L443 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-15 22:56:22,090 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,091 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,091 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,091 INFO L443 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,091 INFO L443 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,091 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,091 INFO L443 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,091 INFO L443 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,091 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-15 22:56:22,091 INFO L443 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-15 22:56:22,091 INFO L443 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-15 22:56:22,092 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,092 INFO L443 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-15 22:56:22,092 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,092 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,092 INFO L443 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-15 22:56:22,092 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,092 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,092 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,092 INFO L443 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,092 INFO L443 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,092 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-15 22:56:22,092 INFO L443 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,092 INFO L443 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-15 22:56:22,092 INFO L443 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-15 22:56:22,092 INFO L443 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-15 22:56:22,092 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,093 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,093 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,093 INFO L443 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,093 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,093 INFO L443 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,093 INFO L443 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,093 INFO L443 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,093 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-15 22:56:22,093 INFO L443 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-15 22:56:22,093 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,093 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,093 INFO L443 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-15 22:56:22,093 INFO L443 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-15 22:56:22,093 INFO L443 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-15 22:56:22,093 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,093 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,093 INFO L443 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,094 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,094 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,094 INFO L443 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,094 INFO L443 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,094 INFO L443 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,094 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,094 INFO L443 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,095 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,095 INFO L443 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-15 22:56:22,095 INFO L443 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-15 22:56:22,095 INFO L443 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-15 22:56:22,095 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:56:22,095 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,095 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,095 INFO L443 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,096 INFO L443 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,096 INFO L443 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,096 INFO L443 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,096 INFO L443 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,096 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-15 22:56:22,096 INFO L443 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-15 22:56:22,096 INFO L443 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,096 INFO L443 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-15 22:56:22,097 INFO L443 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-15 22:56:22,097 INFO L443 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-15 22:56:22,097 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,097 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,097 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,097 INFO L443 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,097 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,097 INFO L443 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-15 22:56:22,098 INFO L443 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-15 22:56:22,098 INFO L443 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,098 INFO L443 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,098 INFO L443 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,098 INFO L443 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-15 22:56:22,098 INFO L443 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-15 22:56:22,098 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,099 INFO L443 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-15 22:56:22,099 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,099 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,099 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,099 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,099 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,099 INFO L443 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,100 INFO L443 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,100 INFO L443 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,100 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,100 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,100 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:56:22,100 INFO L443 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-15 22:56:22,100 INFO L443 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-15 22:56:22,100 INFO L443 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-15 22:56:22,101 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,101 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-15 22:56:22,101 INFO L443 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-15 22:56:22,101 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,101 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,101 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,101 INFO L443 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,101 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,102 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,102 INFO L443 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,102 INFO L443 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,102 INFO L443 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,102 INFO L443 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-15 22:56:22,102 INFO L443 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-15 22:56:22,102 INFO L443 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-15 22:56:22,103 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,103 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,103 INFO L443 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,103 INFO L443 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,103 INFO L443 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:56:22,103 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,103 INFO L443 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-15 22:56:22,103 INFO L443 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-15 22:56:22,104 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,104 INFO L443 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-15 22:56:22,104 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-15 22:56:22,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:56:22 BoogieIcfgContainer [2019-11-15 22:56:22,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:56:22,140 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:56:22,140 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:56:22,141 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:56:22,141 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:55:35" (3/4) ... [2019-11-15 22:56:22,144 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:56:22,178 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 22:56:22,182 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:56:22,448 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_51cd04f2-8c05-466d-95e4-45181780b96c/bin/uautomizer/witness.graphml [2019-11-15 22:56:22,448 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:56:22,449 INFO L168 Benchmark]: Toolchain (without parser) took 50423.22 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.3 GB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -126.7 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-11-15 22:56:22,449 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:56:22,450 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1090.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -120.3 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:56:22,450 INFO L168 Benchmark]: Boogie Procedure Inliner took 157.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:56:22,451 INFO L168 Benchmark]: Boogie Preprocessor took 116.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:56:22,451 INFO L168 Benchmark]: RCFGBuilder took 2473.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 17.0 MB). Peak memory consumption was 189.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:56:22,451 INFO L168 Benchmark]: TraceAbstraction took 46272.62 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -105.6 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-11-15 22:56:22,452 INFO L168 Benchmark]: Witness Printer took 307.64 ms. Allocated memory is still 3.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:56:22,453 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1090.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -120.3 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 157.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 116.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2473.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 17.0 MB). Peak memory consumption was 189.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46272.62 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -105.6 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. * Witness Printer took 307.64 ms. Allocated memory is still 3.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1590]: 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: (((((((((((((((((((((((((((a18 == 1 && a27 == 1) && 1 == a6) && (!(a12 == 1) && !(1 == a11)) && a5 == 1) || ((((((a18 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a26 <= 0) && a5 == 1) && !(1 == a11))) || (((1 == a3 && ((!(a12 == 1) && !(1 == a11)) && a16 == 1) && !(1 == a6)) && a5 == 1) && a18 == 1)) || (((a18 == 1 && a5 == 1) && a26 == 1) && !(1 == a11))) || ((((a3 <= 0 && a18 == 1) && a27 == 1) && a5 == 1) && a16 == 1)) || (((a3 <= 0 && a18 == 1) && a5 == 1) && a26 == 1)) || ((((((a18 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a26 <= 0) && a5 == 1) && !(a27 == 1) && a16 == 1)) || (((((a18 == 1 && 2 <= a3) && a27 == 1) && a5 == 1) && !(1 == a6)) && a26 == 1)) || ((((a18 == 1 && a27 == 1) && a5 == 1) && a26 == 1) && a16 == 1)) || (((a18 == 1 && 2 <= a3) && a27 == 1) && (a5 == 1 && a16 == 1) && !(1 == a11))) || (((a6 <= 0 && a18 == 1) && a5 == 1) && a26 == 1)) || (((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a16 == 1) && a5 == 1) && a18 == 1)) || ((((((a18 == 1 && 2 <= a3) && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a16 == 1)) || ((a18 == 1 && 2 <= a3) && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1)) || (((((a3 <= 0 && a18 == 1) && (!(a27 == 1) && a16 == 1) && !(1 == a11)) && a12 == 1) && a26 <= 0) && a5 == 1)) || (((((a18 == 1 && 2 <= a3) && (!(a27 == 1) && a16 == 1) && !(1 == a11)) && 1 == a6) && a26 <= 0) && a5 == 1)) || (a18 == 1 && (1 == a3 && ((!(a12 == 1) && !(1 == a11)) && !(1 == a6)) && a20 <= 0) && a5 == 1)) || ((((a18 == 1 && 2 <= a3) && a26 <= 0) && a5 == 1) && !(a12 == 1) && !(1 == a6))) || ((a18 == 1 && a27 == 1) && ((!(a12 == 1) && !(1 == a6)) && a20 <= 0) && a5 == 1)) || (((!(a12 == 1) && a18 == 1) && a5 == 1) && a26 == 1)) || ((((a3 <= 0 && a18 == 1) && a27 == 1) && a5 == 1) && a20 <= 0)) || ((((a3 <= 0 && a18 == 1) && a26 <= 0) && a5 == 1) && (a12 == 1 && !(1 == a6)) && !(1 == a11))) || (((((a18 == 1 && 2 <= a3) && a27 == 1) && a26 <= 0) && a5 == 1) && !(1 == a11))) || ((((a3 <= 0 && !(a12 == 1)) && a18 == 1) && a27 == 1) && a5 == 1)) || (((((!(a12 == 1) && a18 == 1) && 2 <= a3) && a27 == 1) && a26 <= 0) && a5 == 1)) || ((a18 == 1 && 2 <= a3) && (!(a12 == 1) && !(1 == a11)) && a5 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((a18 == 1 && a27 == 1) && 1 == a6) && (!(a12 == 1) && !(1 == a11)) && a5 == 1) || ((((((a18 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a26 <= 0) && a5 == 1) && !(1 == a11))) || (((1 == a3 && ((!(a12 == 1) && !(1 == a11)) && a16 == 1) && !(1 == a6)) && a5 == 1) && a18 == 1)) || (((a18 == 1 && a5 == 1) && a26 == 1) && !(1 == a11))) || ((((a3 <= 0 && a18 == 1) && a27 == 1) && a5 == 1) && a16 == 1)) || (((a3 <= 0 && a18 == 1) && a5 == 1) && a26 == 1)) || ((((((a18 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a26 <= 0) && a5 == 1) && !(a27 == 1) && a16 == 1)) || (((((a18 == 1 && 2 <= a3) && a27 == 1) && a5 == 1) && !(1 == a6)) && a26 == 1)) || ((((a18 == 1 && a27 == 1) && a5 == 1) && a26 == 1) && a16 == 1)) || (((a18 == 1 && 2 <= a3) && a27 == 1) && (a5 == 1 && a16 == 1) && !(1 == a11))) || (((a6 <= 0 && a18 == 1) && a5 == 1) && a26 == 1)) || (((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a16 == 1) && a5 == 1) && a18 == 1)) || ((((((a18 == 1 && 2 <= a3) && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a16 == 1)) || ((a18 == 1 && 2 <= a3) && ((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1)) || (((((a3 <= 0 && a18 == 1) && (!(a27 == 1) && a16 == 1) && !(1 == a11)) && a12 == 1) && a26 <= 0) && a5 == 1)) || (((((a18 == 1 && 2 <= a3) && (!(a27 == 1) && a16 == 1) && !(1 == a11)) && 1 == a6) && a26 <= 0) && a5 == 1)) || (a18 == 1 && (1 == a3 && ((!(a12 == 1) && !(1 == a11)) && !(1 == a6)) && a20 <= 0) && a5 == 1)) || ((((a18 == 1 && 2 <= a3) && a26 <= 0) && a5 == 1) && !(a12 == 1) && !(1 == a6))) || ((a18 == 1 && a27 == 1) && ((!(a12 == 1) && !(1 == a6)) && a20 <= 0) && a5 == 1)) || (((!(a12 == 1) && a18 == 1) && a5 == 1) && a26 == 1)) || ((((a3 <= 0 && a18 == 1) && a27 == 1) && a5 == 1) && a20 <= 0)) || ((((a3 <= 0 && a18 == 1) && a26 <= 0) && a5 == 1) && (a12 == 1 && !(1 == a6)) && !(1 == a11))) || (((((a18 == 1 && 2 <= a3) && a27 == 1) && a26 <= 0) && a5 == 1) && !(1 == a11))) || ((((a3 <= 0 && !(a12 == 1)) && a18 == 1) && a27 == 1) && a5 == 1)) || (((((!(a12 == 1) && a18 == 1) && 2 <= a3) && a27 == 1) && a26 <= 0) && a5 == 1)) || ((a18 == 1 && 2 <= a3) && (!(a12 == 1) && !(1 == a11)) && a5 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 46.1s, OverallIterations: 18, TraceHistogramMax: 5, AutomataDifference: 25.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.3s, HoareTripleCheckerStatistics: 3544 SDtfs, 5860 SDslu, 1376 SDs, 0 SdLazy, 13312 SolverSat, 2184 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 931 GetRequests, 894 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74071occurred 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: 7.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 33863 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 624 NumberOfFragments, 1091 HoareAnnotationTreeSize, 3 FomulaSimplifications, 25178 FormulaSimplificationTreeSizeReduction, 2.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 21320 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 5410 NumberOfCodeBlocks, 5410 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 5389 ConstructedInterpolants, 0 QuantifiedInterpolants, 2431439 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1640 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 21 InterpolantComputations, 18 PerfectInterpolantSequences, 2243/2257 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...