./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label30.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_3f13904a-1298-4a14-8dff-dd113805e58b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3f13904a-1298-4a14-8dff-dd113805e58b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3f13904a-1298-4a14-8dff-dd113805e58b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3f13904a-1298-4a14-8dff-dd113805e58b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label30.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3f13904a-1298-4a14-8dff-dd113805e58b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3f13904a-1298-4a14-8dff-dd113805e58b/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 cc1563f4697cf21aca476a1aac04fcd8ee81163f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:28:02,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:28:02,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:28:02,083 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:28:02,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:28:02,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:28:02,086 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:28:02,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:28:02,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:28:02,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:28:02,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:28:02,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:28:02,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:28:02,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:28:02,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:28:02,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:28:02,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:28:02,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:28:02,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:28:02,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:28:02,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:28:02,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:28:02,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:28:02,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:28:02,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:28:02,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:28:02,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:28:02,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:28:02,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:28:02,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:28:02,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:28:02,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:28:02,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:28:02,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:28:02,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:28:02,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:28:02,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:28:02,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:28:02,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:28:02,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:28:02,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:28:02,122 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3f13904a-1298-4a14-8dff-dd113805e58b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:28:02,136 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:28:02,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:28:02,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:28:02,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:28:02,138 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:28:02,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:28:02,138 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:28:02,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:28:02,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:28:02,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:28:02,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:28:02,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:28:02,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:28:02,140 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:28:02,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:28:02,140 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:28:02,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:28:02,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:28:02,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:28:02,141 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:28:02,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:28:02,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:28:02,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:28:02,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:28:02,142 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:28:02,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:28:02,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:28:02,143 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:28:02,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_3f13904a-1298-4a14-8dff-dd113805e58b/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 -> cc1563f4697cf21aca476a1aac04fcd8ee81163f [2019-11-16 00:28:02,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:28:02,180 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:28:02,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:28:02,184 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:28:02,185 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:28:02,185 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3f13904a-1298-4a14-8dff-dd113805e58b/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label30.c [2019-11-16 00:28:02,244 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f13904a-1298-4a14-8dff-dd113805e58b/bin/uautomizer/data/808be9956/c104e322f0ad48cca3e823847c2f02dc/FLAGb2859336a [2019-11-16 00:28:02,784 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:28:02,784 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3f13904a-1298-4a14-8dff-dd113805e58b/sv-benchmarks/c/eca-rers2012/Problem01_label30.c [2019-11-16 00:28:02,796 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f13904a-1298-4a14-8dff-dd113805e58b/bin/uautomizer/data/808be9956/c104e322f0ad48cca3e823847c2f02dc/FLAGb2859336a [2019-11-16 00:28:03,011 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3f13904a-1298-4a14-8dff-dd113805e58b/bin/uautomizer/data/808be9956/c104e322f0ad48cca3e823847c2f02dc [2019-11-16 00:28:03,014 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:28:03,016 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:28:03,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:28:03,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:28:03,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:28:03,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:28:03" (1/1) ... [2019-11-16 00:28:03,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d86caae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:03, skipping insertion in model container [2019-11-16 00:28:03,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:28:03" (1/1) ... [2019-11-16 00:28:03,033 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:28:03,080 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:28:03,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:28:03,587 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:28:03,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:28:03,764 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:28:03,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:03 WrapperNode [2019-11-16 00:28:03,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:28:03,765 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:28:03,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:28:03,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:28:03,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:03" (1/1) ... [2019-11-16 00:28:03,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:03" (1/1) ... [2019-11-16 00:28:03,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:28:03,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:28:03,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:28:03,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:28:03,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:03" (1/1) ... [2019-11-16 00:28:03,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:03" (1/1) ... [2019-11-16 00:28:03,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:03" (1/1) ... [2019-11-16 00:28:03,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:03" (1/1) ... [2019-11-16 00:28:03,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:03" (1/1) ... [2019-11-16 00:28:03,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:03" (1/1) ... [2019-11-16 00:28:03,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:03" (1/1) ... [2019-11-16 00:28:03,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:28:03,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:28:03,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:28:03,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:28:03,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f13904a-1298-4a14-8dff-dd113805e58b/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-16 00:28:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:28:04,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:28:05,942 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:28:05,942 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:28:05,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:28:05 BoogieIcfgContainer [2019-11-16 00:28:05,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:28:05,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:28:05,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:28:05,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:28:05,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:28:03" (1/3) ... [2019-11-16 00:28:05,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79077bdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:28:05, skipping insertion in model container [2019-11-16 00:28:05,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:03" (2/3) ... [2019-11-16 00:28:05,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79077bdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:28:05, skipping insertion in model container [2019-11-16 00:28:05,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:28:05" (3/3) ... [2019-11-16 00:28:05,954 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label30.c [2019-11-16 00:28:05,966 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:28:05,979 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:28:05,994 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:28:06,035 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:28:06,036 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:28:06,036 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:28:06,036 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:28:06,036 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:28:06,036 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:28:06,037 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:28:06,037 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:28:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-16 00:28:06,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-16 00:28:06,081 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:06,082 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] [2019-11-16 00:28:06,085 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:06,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:06,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1318724346, now seen corresponding path program 1 times [2019-11-16 00:28:06,104 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:06,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511335127] [2019-11-16 00:28:06,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:06,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:06,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:06,675 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-16 00:28:06,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511335127] [2019-11-16 00:28:06,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:06,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:28:06,679 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729463977] [2019-11-16 00:28:06,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:28:06,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:06,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:28:06,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:28:06,709 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-11-16 00:28:08,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:08,084 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-11-16 00:28:08,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:28:08,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-16 00:28:08,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:08,122 INFO L225 Difference]: With dead ends: 528 [2019-11-16 00:28:08,122 INFO L226 Difference]: Without dead ends: 266 [2019-11-16 00:28:08,136 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-16 00:28:08,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-16 00:28:08,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-11-16 00:28:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-16 00:28:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 374 transitions. [2019-11-16 00:28:08,261 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 374 transitions. Word has length 125 [2019-11-16 00:28:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:08,264 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 374 transitions. [2019-11-16 00:28:08,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:28:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 374 transitions. [2019-11-16 00:28:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-16 00:28:08,286 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:08,287 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-16 00:28:08,287 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:08,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:08,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1866428878, now seen corresponding path program 1 times [2019-11-16 00:28:08,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:08,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50987573] [2019-11-16 00:28:08,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:08,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:08,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:28:08,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50987573] [2019-11-16 00:28:08,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:08,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:28:08,650 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577478190] [2019-11-16 00:28:08,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:28:08,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:08,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:28:08,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:28:08,653 INFO L87 Difference]: Start difference. First operand 266 states and 374 transitions. Second operand 3 states. [2019-11-16 00:28:09,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:09,488 INFO L93 Difference]: Finished difference Result 792 states and 1117 transitions. [2019-11-16 00:28:09,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:28:09,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-16 00:28:09,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:09,496 INFO L225 Difference]: With dead ends: 792 [2019-11-16 00:28:09,496 INFO L226 Difference]: Without dead ends: 528 [2019-11-16 00:28:09,498 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-16 00:28:09,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-16 00:28:09,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-11-16 00:28:09,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-16 00:28:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 708 transitions. [2019-11-16 00:28:09,537 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 708 transitions. Word has length 129 [2019-11-16 00:28:09,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:09,538 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 708 transitions. [2019-11-16 00:28:09,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:28:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 708 transitions. [2019-11-16 00:28:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-16 00:28:09,551 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:09,551 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:09,551 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:09,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:09,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1624585415, now seen corresponding path program 1 times [2019-11-16 00:28:09,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:09,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103313939] [2019-11-16 00:28:09,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:09,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:09,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:28:09,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103313939] [2019-11-16 00:28:09,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:09,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:28:09,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322821683] [2019-11-16 00:28:09,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:28:09,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:09,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:28:09,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:28:09,748 INFO L87 Difference]: Start difference. First operand 528 states and 708 transitions. Second operand 3 states. [2019-11-16 00:28:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:10,430 INFO L93 Difference]: Finished difference Result 1316 states and 1785 transitions. [2019-11-16 00:28:10,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:28:10,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-16 00:28:10,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:10,437 INFO L225 Difference]: With dead ends: 1316 [2019-11-16 00:28:10,437 INFO L226 Difference]: Without dead ends: 790 [2019-11-16 00:28:10,439 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-16 00:28:10,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-16 00:28:10,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659. [2019-11-16 00:28:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-16 00:28:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 888 transitions. [2019-11-16 00:28:10,467 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 888 transitions. Word has length 148 [2019-11-16 00:28:10,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:10,468 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 888 transitions. [2019-11-16 00:28:10,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:28:10,468 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 888 transitions. [2019-11-16 00:28:10,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-16 00:28:10,471 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:10,471 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:10,472 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:10,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:10,472 INFO L82 PathProgramCache]: Analyzing trace with hash 130660739, now seen corresponding path program 1 times [2019-11-16 00:28:10,472 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:10,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451934830] [2019-11-16 00:28:10,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:10,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:10,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:10,694 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-16 00:28:10,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451934830] [2019-11-16 00:28:10,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:10,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:28:10,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073485006] [2019-11-16 00:28:10,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:28:10,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:10,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:28:10,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:28:10,697 INFO L87 Difference]: Start difference. First operand 659 states and 888 transitions. Second operand 4 states. [2019-11-16 00:28:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:11,530 INFO L93 Difference]: Finished difference Result 1449 states and 1931 transitions. [2019-11-16 00:28:11,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:28:11,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-16 00:28:11,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:11,535 INFO L225 Difference]: With dead ends: 1449 [2019-11-16 00:28:11,535 INFO L226 Difference]: Without dead ends: 792 [2019-11-16 00:28:11,537 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:28:11,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-11-16 00:28:11,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 790. [2019-11-16 00:28:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-16 00:28:11,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1025 transitions. [2019-11-16 00:28:11,561 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1025 transitions. Word has length 152 [2019-11-16 00:28:11,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:11,561 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1025 transitions. [2019-11-16 00:28:11,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:28:11,562 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1025 transitions. [2019-11-16 00:28:11,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-16 00:28:11,565 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:11,565 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:11,565 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:11,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:11,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1709270971, now seen corresponding path program 1 times [2019-11-16 00:28:11,566 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:11,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107936699] [2019-11-16 00:28:11,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:11,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:11,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:11,693 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-16 00:28:11,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107936699] [2019-11-16 00:28:11,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:11,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:28:11,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955202369] [2019-11-16 00:28:11,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:28:11,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:11,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:28:11,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:28:11,696 INFO L87 Difference]: Start difference. First operand 790 states and 1025 transitions. Second operand 3 states. [2019-11-16 00:28:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:12,278 INFO L93 Difference]: Finished difference Result 1709 states and 2245 transitions. [2019-11-16 00:28:12,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:28:12,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-16 00:28:12,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:12,286 INFO L225 Difference]: With dead ends: 1709 [2019-11-16 00:28:12,286 INFO L226 Difference]: Without dead ends: 1052 [2019-11-16 00:28:12,287 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-16 00:28:12,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-16 00:28:12,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2019-11-16 00:28:12,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-11-16 00:28:12,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1323 transitions. [2019-11-16 00:28:12,319 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1323 transitions. Word has length 156 [2019-11-16 00:28:12,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:12,319 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1323 transitions. [2019-11-16 00:28:12,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:28:12,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1323 transitions. [2019-11-16 00:28:12,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-16 00:28:12,323 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:12,324 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:12,324 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:12,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:12,325 INFO L82 PathProgramCache]: Analyzing trace with hash -467564647, now seen corresponding path program 1 times [2019-11-16 00:28:12,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:12,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969813521] [2019-11-16 00:28:12,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:12,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:12,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-16 00:28:12,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969813521] [2019-11-16 00:28:12,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:12,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:28:12,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264447549] [2019-11-16 00:28:12,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:28:12,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:12,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:28:12,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:28:12,395 INFO L87 Difference]: Start difference. First operand 1052 states and 1323 transitions. Second operand 4 states. [2019-11-16 00:28:13,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:13,408 INFO L93 Difference]: Finished difference Result 3281 states and 4154 transitions. [2019-11-16 00:28:13,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:28:13,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-16 00:28:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:13,431 INFO L225 Difference]: With dead ends: 3281 [2019-11-16 00:28:13,431 INFO L226 Difference]: Without dead ends: 2362 [2019-11-16 00:28:13,433 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-16 00:28:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-11-16 00:28:13,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1707. [2019-11-16 00:28:13,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-16 00:28:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2099 transitions. [2019-11-16 00:28:13,500 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2099 transitions. Word has length 165 [2019-11-16 00:28:13,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:13,501 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2099 transitions. [2019-11-16 00:28:13,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:28:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2099 transitions. [2019-11-16 00:28:13,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-16 00:28:13,507 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:13,507 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:13,507 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:13,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:13,517 INFO L82 PathProgramCache]: Analyzing trace with hash 765811402, now seen corresponding path program 1 times [2019-11-16 00:28:13,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:13,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023667870] [2019-11-16 00:28:13,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:13,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:13,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-16 00:28:13,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023667870] [2019-11-16 00:28:13,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:13,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:28:13,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033177489] [2019-11-16 00:28:13,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:28:13,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:13,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:28:13,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:28:13,709 INFO L87 Difference]: Start difference. First operand 1707 states and 2099 transitions. Second operand 5 states. [2019-11-16 00:28:15,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:15,185 INFO L93 Difference]: Finished difference Result 3805 states and 4667 transitions. [2019-11-16 00:28:15,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:28:15,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2019-11-16 00:28:15,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:15,199 INFO L225 Difference]: With dead ends: 3805 [2019-11-16 00:28:15,199 INFO L226 Difference]: Without dead ends: 2231 [2019-11-16 00:28:15,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:28:15,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-11-16 00:28:15,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1969. [2019-11-16 00:28:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-16 00:28:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2373 transitions. [2019-11-16 00:28:15,260 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2373 transitions. Word has length 171 [2019-11-16 00:28:15,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:15,260 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2373 transitions. [2019-11-16 00:28:15,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:28:15,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2373 transitions. [2019-11-16 00:28:15,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-16 00:28:15,266 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:15,266 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:15,267 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:15,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:15,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1768959985, now seen corresponding path program 1 times [2019-11-16 00:28:15,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:15,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408042191] [2019-11-16 00:28:15,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:15,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:15,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-16 00:28:15,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408042191] [2019-11-16 00:28:15,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:15,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:28:15,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110489190] [2019-11-16 00:28:15,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:28:15,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:15,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:28:15,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:28:15,329 INFO L87 Difference]: Start difference. First operand 1969 states and 2373 transitions. Second operand 3 states. [2019-11-16 00:28:15,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:15,845 INFO L93 Difference]: Finished difference Result 4067 states and 4887 transitions. [2019-11-16 00:28:15,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:28:15,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-11-16 00:28:15,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:15,857 INFO L225 Difference]: With dead ends: 4067 [2019-11-16 00:28:15,857 INFO L226 Difference]: Without dead ends: 1969 [2019-11-16 00:28:15,860 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-16 00:28:15,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-16 00:28:15,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-11-16 00:28:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-16 00:28:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2015 transitions. [2019-11-16 00:28:15,906 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2015 transitions. Word has length 174 [2019-11-16 00:28:15,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:15,906 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2015 transitions. [2019-11-16 00:28:15,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:28:15,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2015 transitions. [2019-11-16 00:28:15,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-16 00:28:15,911 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:15,912 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:15,912 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:15,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:15,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1455962891, now seen corresponding path program 1 times [2019-11-16 00:28:15,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:15,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134142726] [2019-11-16 00:28:15,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:15,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:15,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-16 00:28:16,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134142726] [2019-11-16 00:28:16,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:16,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:28:16,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758088686] [2019-11-16 00:28:16,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:28:16,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:16,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:28:16,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:28:16,026 INFO L87 Difference]: Start difference. First operand 1838 states and 2015 transitions. Second operand 3 states. [2019-11-16 00:28:16,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:16,463 INFO L93 Difference]: Finished difference Result 3674 states and 4028 transitions. [2019-11-16 00:28:16,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:28:16,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-11-16 00:28:16,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:16,474 INFO L225 Difference]: With dead ends: 3674 [2019-11-16 00:28:16,475 INFO L226 Difference]: Without dead ends: 1838 [2019-11-16 00:28:16,477 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-16 00:28:16,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-16 00:28:16,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-16 00:28:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-16 00:28:16,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2010 transitions. [2019-11-16 00:28:16,520 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2010 transitions. Word has length 189 [2019-11-16 00:28:16,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:16,521 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2010 transitions. [2019-11-16 00:28:16,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:28:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2010 transitions. [2019-11-16 00:28:16,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-16 00:28:16,527 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:16,527 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:16,528 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:16,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:16,528 INFO L82 PathProgramCache]: Analyzing trace with hash -380467305, now seen corresponding path program 1 times [2019-11-16 00:28:16,528 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:16,529 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129111922] [2019-11-16 00:28:16,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:16,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:16,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:28:16,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129111922] [2019-11-16 00:28:16,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701527824] [2019-11-16 00:28:16,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f13904a-1298-4a14-8dff-dd113805e58b/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-16 00:28:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:16,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:28:16,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:17,010 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-16 00:28:17,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:28:17,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-16 00:28:17,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662734540] [2019-11-16 00:28:17,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:28:17,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:17,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:28:17,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:28:17,019 INFO L87 Difference]: Start difference. First operand 1838 states and 2010 transitions. Second operand 3 states. [2019-11-16 00:28:17,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:17,512 INFO L93 Difference]: Finished difference Result 3936 states and 4310 transitions. [2019-11-16 00:28:17,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:28:17,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-11-16 00:28:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:17,524 INFO L225 Difference]: With dead ends: 3936 [2019-11-16 00:28:17,525 INFO L226 Difference]: Without dead ends: 1969 [2019-11-16 00:28:17,527 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:28:17,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-16 00:28:17,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-11-16 00:28:17,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-16 00:28:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1977 transitions. [2019-11-16 00:28:17,576 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1977 transitions. Word has length 218 [2019-11-16 00:28:17,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:17,577 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 1977 transitions. [2019-11-16 00:28:17,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:28:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1977 transitions. [2019-11-16 00:28:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-11-16 00:28:17,583 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:17,584 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:17,788 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:17,789 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:17,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:17,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1438607801, now seen corresponding path program 1 times [2019-11-16 00:28:17,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:17,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371306607] [2019-11-16 00:28:17,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:17,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:17,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 141 proven. 70 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-16 00:28:18,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371306607] [2019-11-16 00:28:18,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122440161] [2019-11-16 00:28:18,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f13904a-1298-4a14-8dff-dd113805e58b/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-16 00:28:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:18,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:28:18,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:18,345 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-16 00:28:18,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:28:18,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-16 00:28:18,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445098399] [2019-11-16 00:28:18,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:28:18,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:18,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:28:18,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:28:18,348 INFO L87 Difference]: Start difference. First operand 1838 states and 1977 transitions. Second operand 3 states. [2019-11-16 00:28:18,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:18,830 INFO L93 Difference]: Finished difference Result 1838 states and 1977 transitions. [2019-11-16 00:28:18,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:28:18,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-11-16 00:28:18,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:18,831 INFO L225 Difference]: With dead ends: 1838 [2019-11-16 00:28:18,831 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:28:18,833 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 249 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:28:18,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:28:18,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:28:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:28:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:28:18,834 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 247 [2019-11-16 00:28:18,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:18,834 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:28:18,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:28:18,834 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:28:18,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:28:19,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:19,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:28:19,303 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-11-16 00:28:19,453 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-11-16 00:28:19,455 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-16 00:28:19,456 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-16 00:28:19,456 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,456 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,456 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,456 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,456 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,456 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,456 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-16 00:28:19,457 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-16 00:28:19,457 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-16 00:28:19,457 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-16 00:28:19,457 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-16 00:28:19,457 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-16 00:28:19,457 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-16 00:28:19,457 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-16 00:28:19,457 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-16 00:28:19,458 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-16 00:28:19,458 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,458 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,458 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,458 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,458 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,458 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,458 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-16 00:28:19,458 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-16 00:28:19,459 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-16 00:28:19,459 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-16 00:28:19,459 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-16 00:28:19,459 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-16 00:28:19,459 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-16 00:28:19,459 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-16 00:28:19,459 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-16 00:28:19,459 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-16 00:28:19,459 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-16 00:28:19,459 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-16 00:28:19,460 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-16 00:28:19,460 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-16 00:28:19,460 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-16 00:28:19,460 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,460 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,460 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,460 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,460 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,461 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-16 00:28:19,461 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-16 00:28:19,461 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-16 00:28:19,461 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-16 00:28:19,461 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-16 00:28:19,461 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-16 00:28:19,461 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-16 00:28:19,461 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-16 00:28:19,461 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-16 00:28:19,462 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0)) (.cse1 (<= ~a21~0 0)) (.cse3 (= ~a17~0 1)) (.cse2 (not (= ~a16~0 6))) (.cse4 (= ~a20~0 1)) (.cse5 (not (= ~a7~0 1))) (.cse7 (<= ~a17~0 0)) (.cse6 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4) (and .cse5 .cse3 .cse6) (and .cse7 .cse6 .cse4) (and .cse3 .cse6 .cse4) (and .cse2 .cse7 .cse6) (and .cse6 .cse4 (= ~a16~0 5)) (and .cse5 .cse7 .cse6))) [2019-11-16 00:28:19,462 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,462 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,462 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,462 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,463 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,463 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-16 00:28:19,465 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-16 00:28:19,465 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-16 00:28:19,465 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-16 00:28:19,465 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-16 00:28:19,466 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-16 00:28:19,466 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-16 00:28:19,466 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-16 00:28:19,466 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-16 00:28:19,466 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-16 00:28:19,466 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-16 00:28:19,466 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-16 00:28:19,466 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-16 00:28:19,467 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-16 00:28:19,467 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,467 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,467 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,467 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,467 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,467 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-16 00:28:19,467 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-16 00:28:19,467 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-16 00:28:19,468 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-16 00:28:19,468 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-16 00:28:19,468 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-16 00:28:19,468 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-16 00:28:19,468 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-16 00:28:19,468 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-16 00:28:19,468 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,468 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,468 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,468 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,469 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 551) no Hoare annotation was computed. [2019-11-16 00:28:19,469 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-16 00:28:19,469 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,469 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-16 00:28:19,469 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-16 00:28:19,469 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-16 00:28:19,469 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-16 00:28:19,469 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-16 00:28:19,470 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-16 00:28:19,470 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-16 00:28:19,470 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:28:19,470 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-16 00:28:19,470 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-16 00:28:19,470 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-16 00:28:19,470 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-16 00:28:19,470 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-16 00:28:19,470 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-16 00:28:19,471 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,471 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0)) (.cse1 (<= ~a21~0 0)) (.cse3 (= ~a17~0 1)) (.cse2 (not (= ~a16~0 6))) (.cse4 (= ~a20~0 1)) (.cse5 (not (= ~a7~0 1))) (.cse7 (<= ~a17~0 0)) (.cse6 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4) (and .cse5 .cse3 .cse6) (and .cse7 .cse6 .cse4) (and .cse3 .cse6 .cse4) (and .cse2 .cse7 .cse6) (and .cse6 .cse4 (= ~a16~0 5)) (and .cse5 .cse7 .cse6))) [2019-11-16 00:28:19,471 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,471 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,471 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,471 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,471 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-16 00:28:19,471 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-16 00:28:19,472 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-16 00:28:19,472 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-16 00:28:19,472 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-16 00:28:19,472 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-16 00:28:19,472 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-16 00:28:19,472 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-16 00:28:19,473 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,473 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,473 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,473 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,473 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,473 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-16 00:28:19,473 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:28:19,473 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-16 00:28:19,473 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-16 00:28:19,473 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-16 00:28:19,474 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-16 00:28:19,474 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-16 00:28:19,474 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-16 00:28:19,474 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-16 00:28:19,474 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-16 00:28:19,474 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-16 00:28:19,474 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-16 00:28:19,474 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-16 00:28:19,474 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,475 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,475 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,475 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,475 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-16 00:28:19,475 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,475 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,475 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-16 00:28:19,475 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-16 00:28:19,475 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:28:19,476 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-16 00:28:19,476 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-16 00:28:19,476 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-16 00:28:19,476 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-16 00:28:19,476 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-16 00:28:19,476 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-16 00:28:19,476 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-16 00:28:19,476 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-16 00:28:19,476 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-16 00:28:19,476 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-16 00:28:19,477 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,477 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,477 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,477 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,477 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,477 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-16 00:28:19,477 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,477 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-16 00:28:19,477 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-16 00:28:19,478 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-16 00:28:19,478 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-16 00:28:19,478 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-16 00:28:19,478 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-16 00:28:19,478 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-16 00:28:19,478 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-16 00:28:19,478 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-16 00:28:19,478 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-16 00:28:19,479 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-16 00:28:19,479 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:28:19,479 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-16 00:28:19,479 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-16 00:28:19,479 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-16 00:28:19,479 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,480 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,480 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,480 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,480 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,480 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:28:19,480 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-16 00:28:19,481 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-16 00:28:19,481 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-16 00:28:19,481 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-16 00:28:19,481 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-16 00:28:19,481 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-16 00:28:19,481 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-16 00:28:19,482 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-16 00:28:19,482 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-16 00:28:19,482 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-16 00:28:19,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:28:19 BoogieIcfgContainer [2019-11-16 00:28:19,517 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:28:19,518 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:28:19,518 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:28:19,518 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:28:19,519 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:28:05" (3/4) ... [2019-11-16 00:28:19,522 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:28:19,548 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:28:19,549 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:28:19,698 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3f13904a-1298-4a14-8dff-dd113805e58b/bin/uautomizer/witness.graphml [2019-11-16 00:28:19,699 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:28:19,700 INFO L168 Benchmark]: Toolchain (without parser) took 16684.64 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 426.8 MB). Free memory was 939.4 MB in the beginning and 862.6 MB in the end (delta: 76.9 MB). Peak memory consumption was 503.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:19,700 INFO L168 Benchmark]: CDTParser took 0.26 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-16 00:28:19,701 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:19,701 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:28:19,702 INFO L168 Benchmark]: Boogie Preprocessor took 77.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:19,702 INFO L168 Benchmark]: RCFGBuilder took 2014.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 990.5 MB in the end (delta: 111.3 MB). Peak memory consumption was 111.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:19,703 INFO L168 Benchmark]: TraceAbstraction took 13571.92 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 286.3 MB). Free memory was 990.5 MB in the beginning and 878.7 MB in the end (delta: 111.8 MB). Peak memory consumption was 398.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:19,703 INFO L168 Benchmark]: Witness Printer took 181.06 ms. Allocated memory is still 1.5 GB. Free memory was 878.7 MB in the beginning and 862.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:19,705 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.26 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 748.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2014.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 990.5 MB in the end (delta: 111.3 MB). Peak memory consumption was 111.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13571.92 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 286.3 MB). Free memory was 990.5 MB in the beginning and 878.7 MB in the end (delta: 111.8 MB). Peak memory consumption was 398.1 MB. Max. memory is 11.5 GB. * Witness Printer took 181.06 ms. Allocated memory is still 1.5 GB. Free memory was 878.7 MB in the beginning and 862.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 551]: 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: 30]: Loop Invariant Derived loop invariant: (((((((((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1) || ((1 == a7 && a21 <= 0) && a20 == 1)) || ((!(a7 == 1) && a17 == 1) && a21 == 1)) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((!(a16 == 6) && a17 <= 0) && a21 == 1)) || ((a21 == 1 && a20 == 1) && a16 == 5)) || ((!(a7 == 1) && a17 <= 0) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1) || ((1 == a7 && a21 <= 0) && a20 == 1)) || ((!(a7 == 1) && a17 == 1) && a21 == 1)) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((!(a16 == 6) && a17 <= 0) && a21 == 1)) || ((a21 == 1 && a20 == 1) && a16 == 5)) || ((!(a7 == 1) && a17 <= 0) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 13.4s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 860 SDtfs, 1681 SDslu, 76 SDs, 0 SdLazy, 4427 SolverSat, 713 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 506 GetRequests, 479 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1312 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 37 NumberOfFragments, 177 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1577 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 174 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2339 NumberOfCodeBlocks, 2339 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2326 ConstructedInterpolants, 0 QuantifiedInterpolants, 1007560 SizeOfPredicates, 2 NumberOfNonLiveVariables, 815 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 1245/1342 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...